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 20, 2026 05:46M-RochatM-RochatScore: 12,496Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 20, 2026 05:4612,435114,172,111100,883,0002,333,0002,113,536
2May 20, 2026 05:4612,454114,786,327101,029,0002,341,0002,113,536
3May 20, 2026 05:4612,455114,721,267101,371,0002,011,0002,113,536
4May 20, 2026 05:4612,459113,020,829101,405,0002,009,0002,113,536
5May 20, 2026 05:4612,496113,440,403101,374,0002,349,0002,113,536
6May 20, 2026 05:4612,511115,277,175101,831,0002,014,0002,113,536
7May 20, 2026 05:4612,518114,137,906101,565,0002,339,0002,113,536
8May 20, 2026 05:4612,533114,429,421101,983,0002,044,0002,113,536
9May 20, 2026 05:4612,605115,348,723102,546,0002,077,0002,113,536