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 27, 2026 06:39Victor MerckléVictor MerckléScore: 4,394Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 27, 2026 06:404,34844,419,44534,943,0001,153,0002,117,632stderr
2Aug 27, 2026 06:404,35644,464,05135,058,0001,097,0002,117,632stderr
3Aug 27, 2026 06:404,36044,466,97335,100,0001,094,0002,117,632stderr
4Aug 27, 2026 06:404,37344,581,65535,189,0001,107,0002,117,632stderr
5Aug 27, 2026 06:404,39444,758,30935,376,0001,095,0002,117,632stderr
6Aug 27, 2026 06:404,40944,893,42135,561,0001,039,0002,117,632stderr
7Aug 27, 2026 06:404,45045,950,15635,745,0001,195,0002,117,632stderr
8Aug 27, 2026 06:404,56546,838,05936,811,0001,081,0002,117,632stderr
9Aug 27, 2026 06:404,67047,043,01137,682,0001,085,0002,117,632stderr