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 22, 2026 09:47Kevin HeaveyKevin HeaveyScore: 62,098Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 22, 2026 09:5461,187520,551,832505,846,0002,008,0002,117,632
2Jul 22, 2026 09:5461,824523,079,786510,861,0002,284,0002,117,632
3Jul 22, 2026 09:5461,839523,236,221510,970,0002,299,0002,117,632
4Jul 22, 2026 09:5462,075525,181,794513,026,0002,204,0002,117,632
5Jul 22, 2026 09:5462,098525,430,540513,397,0002,023,0002,117,632
6Jul 22, 2026 09:5462,898531,937,542519,894,0002,165,0002,117,632
7Jul 22, 2026 09:5462,959534,934,376520,426,0002,134,0002,117,632
8Jul 22, 2026 09:5463,394536,109,256524,012,0002,165,0002,117,632
9Jul 22, 2026 09:5464,121544,767,418530,201,0002,004,0002,117,632