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 25, 2026 01:32Victor MerckléVictor MerckléScore: 7,436Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 25, 2026 01:337,32369,213,22959,626,0001,159,0002,117,632stderr
2Aug 25, 2026 01:337,36269,535,58859,966,0001,145,0002,117,632stderr
3Aug 25, 2026 01:337,39169,753,76660,184,0001,164,0002,117,632stderr
4Aug 25, 2026 01:337,43171,313,65360,599,0001,080,0002,117,632stderr
5Aug 25, 2026 01:337,43670,115,35660,607,0001,119,0002,117,632stderr
6Aug 25, 2026 01:337,46370,329,86760,851,0001,098,0002,117,632stderr
7Aug 25, 2026 01:337,51470,735,67561,279,0001,094,0002,117,632stderr
8Aug 25, 2026 01:337,64272,395,51962,381,0001,055,0002,117,632stderr
9Aug 25, 2026 01:337,65571,976,14262,462,0001,079,0002,117,632stderr