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 listSep 6, 2026 12:07Kevin HeaveyKevin HeaveyScore: 3,822Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 6, 2026 12:083,54339,394,02128,272,0001,140,0002,113,536
2Sep 6, 2026 12:083,55939,616,06628,399,0001,144,0002,113,536
3Sep 6, 2026 12:083,57039,604,06328,432,0001,200,0002,113,536
4Sep 6, 2026 12:083,78442,383,43730,207,0001,207,0002,113,536
5Sep 6, 2026 12:083,82241,820,65730,685,0001,042,0002,113,536
6Sep 6, 2026 12:083,83842,102,87730,680,0001,180,0002,113,536
7Sep 6, 2026 12:083,85142,104,37330,821,0001,143,0002,113,536
8Sep 6, 2026 12:083,85942,042,14230,891,0001,143,0002,113,536
9Sep 6, 2026 12:083,87942,302,22031,042,0001,159,0002,113,536