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 listSep 16, 2026 23:54Victor MerckléVictor MerckléScore: 50,364Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 16, 2026 23:5550,096425,562,351414,693,0001,106,0002,117,632stderr
2Sep 16, 2026 23:5550,210426,560,114415,731,0001,017,0002,117,632stderr
3Sep 16, 2026 23:5550,319427,473,196416,647,0001,002,0002,117,632stderr
4Sep 16, 2026 23:5550,363427,955,201416,986,0001,029,0002,117,632stderr
5Sep 16, 2026 23:5550,364427,879,791417,020,0001,008,0002,117,632stderr
6Sep 16, 2026 23:5550,400428,136,089417,217,0001,103,0002,117,632stderr
7Sep 16, 2026 23:5550,473428,644,832417,767,0001,163,0002,117,632stderr
8Sep 16, 2026 23:5550,637430,007,826419,202,0001,089,0002,117,632stderr
9Sep 16, 2026 23:5550,886432,137,774421,275,0001,086,0002,117,632stderr