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 18, 2026 12:35Kevin HeaveyKevin HeaveyScore: 3,704Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 18, 2026 12:543,67940,387,66029,493,0001,045,0002,113,536
2Jul 18, 2026 12:543,68041,623,08629,501,0001,045,0002,113,536
3Jul 18, 2026 12:543,68341,527,38529,528,0001,044,0002,113,536
4Jul 18, 2026 12:543,69942,205,87729,671,0001,038,0002,113,536
5Jul 18, 2026 12:543,70440,582,86729,701,0001,045,0002,113,536
6Jul 18, 2026 12:543,71140,644,24329,754,0001,049,0002,113,536
7Jul 18, 2026 12:543,84441,722,14830,862,0001,045,0002,113,536
8Jul 18, 2026 12:543,93742,508,88631,640,0001,044,0002,113,536
9Jul 18, 2026 12:543,99642,887,00032,122,0001,047,0002,113,536