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 11, 2026 16:10Victor MerckléVictor MerckléScore: 3,989Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 11, 2026 16:133,94941,205,63231,748,0001,034,0002,117,632stderr
2Aug 11, 2026 16:133,96841,273,97131,911,0001,031,0002,117,632stderr
3Aug 11, 2026 16:133,98041,426,89831,998,0001,040,0002,117,632stderr
4Aug 11, 2026 16:133,98141,393,49132,018,0001,030,0002,117,632stderr
5Aug 11, 2026 16:133,98941,509,55932,077,0001,033,0002,117,632stderr
6Aug 11, 2026 16:133,99041,475,56232,059,0001,065,0002,117,632stderr
7Aug 11, 2026 16:134,00541,644,62032,217,0001,027,0002,117,632stderr
8Aug 11, 2026 16:134,00641,724,88732,090,0001,168,0002,117,632stderr
9Aug 11, 2026 16:134,04441,979,01332,553,0001,017,0002,117,632stderr