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 10, 2026 18:21Victor MerckléVictor MerckléScore: 3,912Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 10, 2026 18:213,90340,782,31131,170,0001,226,0002,117,632stderr
2Aug 10, 2026 18:213,90640,593,42731,209,0001,218,0002,117,632stderr
3Aug 10, 2026 18:213,90941,930,77231,247,0001,201,0002,117,632stderr
4Aug 10, 2026 18:213,91240,556,66331,321,0001,150,0002,117,632stderr
5Aug 10, 2026 18:213,91240,628,46131,234,0001,237,0002,117,632stderr
6Aug 10, 2026 18:213,91440,640,11231,313,0001,178,0002,117,632stderr
7Aug 10, 2026 18:213,91840,676,54731,361,0001,164,0002,117,632stderr
8Aug 10, 2026 18:213,92140,724,43731,536,0001,014,0002,117,632stderr
9Aug 10, 2026 18:213,94140,849,97531,520,0001,196,0002,117,632stderr