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 listMay 10, 2026 19:17Josu San MartinJosu San MartinScore: 3,867Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 10, 2026 19:173,85439,595,53530,925,0001,065,0002,113,536
2May 10, 2026 19:173,86139,410,52730,965,0001,084,0002,113,536
3May 10, 2026 19:173,86440,272,71031,011,0001,063,0002,113,536
4May 10, 2026 19:173,86440,983,11330,982,0001,093,0002,113,536
5May 10, 2026 19:173,86742,675,39830,995,0001,104,0002,113,536
6May 10, 2026 19:173,87440,703,09131,079,0001,083,0002,113,536
7May 10, 2026 19:173,89042,503,40331,206,0001,081,0002,113,536
8May 10, 2026 19:174,00540,688,07932,157,0001,085,0002,113,536
9May 10, 2026 19:174,00940,503,39132,175,0001,106,0002,113,536