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 15:12Victor MerckléVictor MerckléScore: 8,066Success
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 15:137,90173,961,36364,542,0001,041,0002,117,632stderr
2Aug 28, 2026 15:137,99074,654,66265,298,0001,027,0002,117,632stderr
3Aug 28, 2026 15:138,06675,356,04765,840,0001,108,0002,117,632stderr
4Aug 28, 2026 15:138,06675,292,34565,932,0001,016,0002,117,632stderr
5Aug 28, 2026 15:138,06675,299,93565,906,0001,048,0002,117,632stderr
6Aug 28, 2026 15:138,09775,548,79266,093,0001,120,0002,117,632stderr
7Aug 28, 2026 15:138,22676,641,20467,265,0001,019,0002,117,632stderr
8Aug 28, 2026 15:138,24276,813,18867,389,0001,025,0002,117,632stderr
9Aug 28, 2026 15:138,26276,989,79367,528,0001,050,0002,117,632stderr