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 28, 2026 21:11Victor MerckléVictor MerckléScore: 5,348Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 28, 2026 21:115,32753,225,13943,180,0001,037,0002,117,632stderr
2Aug 28, 2026 21:115,32852,493,50443,211,0001,019,0002,117,632stderr
3Aug 28, 2026 21:115,33253,329,40643,241,0001,020,0002,117,632stderr
4Aug 28, 2026 21:115,34153,344,82043,319,0001,018,0002,117,632stderr
5Aug 28, 2026 21:115,34853,398,68543,375,0001,019,0002,117,632stderr
6Aug 28, 2026 21:115,35053,443,11143,378,0001,029,0002,117,632stderr
7Aug 28, 2026 21:115,35653,463,24643,429,0001,027,0002,117,632stderr
8Aug 28, 2026 21:115,36853,541,90643,517,0001,040,0002,117,632stderr
9Aug 28, 2026 21:115,51954,843,87944,772,0001,036,0002,117,632stderr