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 23, 2026 18:59Victor MerckléVictor MerckléScore: 3,783Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 23, 2026 19:003,75339,627,04029,973,0001,182,0002,117,632stderr
2Aug 23, 2026 19:003,75839,567,77130,074,0001,124,0002,117,632stderr
3Aug 23, 2026 19:003,76639,619,97430,194,0001,064,0002,117,632stderr
4Aug 23, 2026 19:003,78039,760,01030,263,0001,113,0002,117,632stderr
5Aug 23, 2026 19:003,78339,758,49730,303,0001,104,0002,117,632stderr
6Aug 23, 2026 19:003,79040,019,47630,335,0001,130,0002,117,632stderr
7Aug 23, 2026 19:003,79639,883,35230,388,0001,123,0002,117,632stderr
8Aug 23, 2026 19:003,86240,407,22030,976,0001,084,0002,117,632stderr
9Aug 23, 2026 19:004,02141,773,22432,312,0001,069,0002,117,632stderr