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 03:47Victor MerckléVictor MerckléScore: 3,990Success
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 03:473,92641,002,58631,481,0001,111,0002,117,632stderr
2Aug 25, 2026 03:473,94841,091,17331,666,0001,110,0002,117,632stderr
3Aug 25, 2026 03:473,97941,314,10731,957,0001,071,0002,117,632stderr
4Aug 25, 2026 03:473,98741,466,42331,983,0001,114,0002,117,632stderr
5Aug 25, 2026 03:473,99041,481,19331,985,0001,132,0002,117,632stderr
6Aug 25, 2026 03:474,00242,165,40032,106,0001,114,0002,117,632stderr
7Aug 25, 2026 03:474,02641,745,98232,338,0001,086,0002,117,632stderr
8Aug 25, 2026 03:474,02941,780,84932,395,0001,047,0002,117,632stderr
9Aug 25, 2026 03:474,05942,824,07932,525,0001,170,0002,117,632stderr