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 21, 2026 20:05Kevin HeaveyKevin HeaveyScore: 3,859Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 21, 2026 20:063,82341,409,78429,536,0002,198,0002,117,632
2Jul 21, 2026 20:063,83941,588,96829,682,0002,187,0002,117,632
3Jul 21, 2026 20:063,84141,547,46129,689,0002,198,0002,121,728
4Jul 21, 2026 20:063,85643,628,46529,772,0002,238,0002,117,632
5Jul 21, 2026 20:063,85945,568,27729,849,0002,187,0002,117,632
6Jul 21, 2026 20:063,86641,737,40129,866,0002,229,0002,121,728
7Jul 21, 2026 20:063,86943,569,00029,884,0002,231,0002,117,632
8Jul 21, 2026 20:063,87241,737,07329,959,0002,179,0002,117,632
9Jul 21, 2026 20:063,91042,085,16730,302,0002,157,0002,121,728