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 00:16Maya RebholzMaya RebholzScore: 15,920Success
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 00:1715,851143,224,591122,340,0009,231,0002,113,536
2May 20, 2026 00:1715,893141,647,596122,725,0009,190,0002,113,536
3May 20, 2026 00:1715,897143,819,613122,698,0009,252,0002,113,536
4May 20, 2026 00:1715,908141,407,086122,813,0009,226,0002,113,536
5May 20, 2026 00:1715,920142,153,282122,651,0009,485,0002,113,536
6May 20, 2026 00:1715,938143,616,558122,714,0009,575,0002,113,536
7May 20, 2026 00:1715,940144,368,373122,809,0009,495,0002,113,536
8May 20, 2026 00:1715,960144,360,253122,512,0009,959,0002,113,536
9May 20, 2026 00:1716,011144,793,085122,659,00010,234,0002,113,536