Parse integers Sergey Svistunov

Compute the sum of integers read from STDIN as fast as possible.

Input: 50 000 000 lines, each containing one integer in the range [0; 2147483647].

629871117
2024562523
1372689083
1021777120
2111176472

Output: The uint64 sum of all numbers, printed as a decimal string.

Note: Integer overflow is expected – use a 64-bit accumulator.

Back to listJul 30, 2026 19:19boop34boop34Score: 32,785Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 30, 2026 19:2032,772281,937,477270,907,0001,105,0002,113,536
2Jul 30, 2026 19:2032,781282,317,411270,943,0001,147,0002,113,536
3Jul 30, 2026 19:2032,781281,958,719270,977,0001,109,0002,113,536
4Jul 30, 2026 19:2032,783282,079,860270,913,0001,190,0002,113,536
5Jul 30, 2026 19:2032,785282,152,270271,000,0001,118,0002,113,536
6Jul 30, 2026 19:2032,786281,984,006271,014,0001,111,0002,113,536
7Jul 30, 2026 19:2032,791282,041,218271,060,0001,108,0002,113,536
8Jul 30, 2026 19:2032,814282,284,713271,101,0001,260,0002,113,536
9Jul 30, 2026 19:2032,816282,258,248271,104,0001,276,0002,113,536