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 00:34Victor MerckléVictor MerckléScore: 3,887Success
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 00:353,83740,154,84830,740,0001,109,0002,117,632stderr
2Aug 11, 2026 00:353,85040,328,40830,853,0001,107,0002,117,632stderr
3Aug 11, 2026 00:353,85540,315,30130,802,0001,199,0002,117,632stderr
4Aug 11, 2026 00:353,86840,423,84430,998,0001,114,0002,117,632stderr
5Aug 11, 2026 00:353,88740,551,27131,173,0001,091,0002,117,632stderr
6Aug 11, 2026 00:353,89440,509,00231,122,0001,203,0002,117,632stderr
7Aug 11, 2026 00:353,90740,795,75531,250,0001,182,0002,117,632stderr
8Aug 11, 2026 00:353,91940,765,29031,361,0001,174,0002,117,632stderr
9Aug 11, 2026 00:354,02542,421,43632,289,0001,121,0002,117,632stderr