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 8, 2026 02:19Victor MerckléVictor MerckléScore: 87,091Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 8, 2026 02:2387,002741,388,624720,960,0001,158,0002,117,632stderr
2Sep 8, 2026 02:2387,014741,016,405721,047,0001,173,0002,117,632stderr
3Sep 8, 2026 02:2387,042741,202,461721,274,0001,181,0002,117,632stderr
4Sep 8, 2026 02:2387,063741,361,734721,625,0001,001,0002,117,632stderr
5Sep 8, 2026 02:2387,091741,451,220721,797,0001,065,0002,117,632stderr
6Sep 8, 2026 02:2387,168742,899,708722,326,0001,171,0002,117,632stderr
7Sep 8, 2026 02:2387,242743,354,224723,019,0001,090,0002,117,632stderr
8Sep 8, 2026 02:2387,313743,391,099723,615,0001,085,0002,117,632stderr
9Sep 8, 2026 02:2387,367744,383,712723,961,0001,189,0002,117,632stderr