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 listJul 7, 2026 03:30Victor MerckléVictor MerckléScore: 5,976Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2026 03:325,90957,151,30747,968,0001,080,0002,117,632stderr
2Jul 7, 2026 03:325,93057,330,05748,145,0001,081,0002,117,632stderr
3Jul 7, 2026 03:325,93157,346,79648,183,0001,049,0002,117,632stderr
4Jul 7, 2026 03:325,97058,112,09248,374,0001,178,0002,117,632stderr
5Jul 7, 2026 03:325,97657,676,34848,413,0001,196,0002,117,632stderr
6Jul 7, 2026 03:325,97757,723,49048,451,0001,162,0002,117,632stderr
7Jul 7, 2026 03:325,97957,776,63048,452,0001,180,0002,117,632stderr
8Jul 7, 2026 03:325,97957,764,51848,603,0001,028,0002,117,632stderr
9Jul 7, 2026 03:325,99157,848,24748,596,0001,133,0002,117,632stderr