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 listAug 27, 2026 10:28Victor MerckléVictor MerckléScore: 4,017Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 27, 2026 10:293,97641,390,13231,812,0001,189,0002,113,536
2Aug 27, 2026 10:293,98141,491,50631,813,0001,234,0002,113,536
3Aug 27, 2026 10:293,99041,525,71131,948,0001,177,0002,113,536
4Aug 27, 2026 10:294,01342,053,48132,155,0001,154,0002,113,536
5Aug 27, 2026 10:294,01741,729,36332,132,0001,213,0002,113,536
6Aug 27, 2026 10:294,03442,136,22132,279,0001,208,0002,113,536
7Aug 27, 2026 10:294,08142,271,77032,717,0001,158,0002,113,536
8Aug 27, 2026 10:294,10942,506,74932,886,0001,225,0002,113,536
9Aug 27, 2026 10:294,29444,045,48234,531,0001,114,0002,113,536