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 13:08Victor MerckléVictor MerckléScore: 3,814Success
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 13:093,78439,823,86230,338,0001,077,0002,117,632stderr
2Aug 25, 2026 13:093,78740,094,10530,146,0001,291,0002,117,632stderr
3Aug 25, 2026 13:093,79639,943,76330,437,0001,076,0002,117,632stderr
4Aug 25, 2026 13:093,81039,992,28230,547,0001,081,0002,117,632stderr
5Aug 25, 2026 13:093,81440,018,39230,576,0001,083,0002,117,632stderr
6Aug 25, 2026 13:093,82940,208,23430,661,0001,122,0002,117,632stderr
7Aug 25, 2026 13:093,83240,246,05630,740,0001,073,0002,117,632stderr
8Aug 25, 2026 13:093,89940,787,71031,248,0001,119,0002,117,632stderr
9Aug 25, 2026 13:093,95041,172,27531,692,0001,094,0002,117,632stderr