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 12, 2026 22:32Victor MerckléVictor MerckléScore: 3,834Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 12, 2026 22:333,79639,932,01430,397,0001,114,0002,117,632stderr
2Aug 12, 2026 22:333,80840,049,55730,525,0001,087,0002,117,632stderr
3Aug 12, 2026 22:333,83140,229,43530,703,0001,097,0002,117,632stderr
4Aug 12, 2026 22:333,83440,264,40930,753,0001,077,0002,117,632stderr
5Aug 12, 2026 22:333,83440,221,26030,750,0001,075,0002,117,632stderr
6Aug 12, 2026 22:333,83640,269,95330,635,0001,210,0002,117,632stderr
7Aug 12, 2026 22:333,84540,319,75030,836,0001,078,0002,117,632stderr
8Aug 12, 2026 22:333,87040,760,70430,838,0001,286,0002,117,632stderr
9Aug 12, 2026 22:333,99141,535,01731,981,0001,148,0002,117,632stderr