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 2, 2026 03:52Victor MerckléVictor MerckléScore: 4,420Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 2, 2026 03:534,39244,851,42935,350,0001,104,0002,117,632stderr
2Sep 2, 2026 03:534,41045,021,33235,499,0001,112,0002,117,632stderr
3Sep 2, 2026 03:534,41045,020,03635,492,0001,118,0002,117,632stderr
4Sep 2, 2026 03:534,41545,061,55335,560,0001,089,0002,117,632stderr
5Sep 2, 2026 03:534,42045,112,18235,594,0001,096,0002,117,632stderr
6Sep 2, 2026 03:534,42145,069,09435,619,0001,082,0002,117,632stderr
7Sep 2, 2026 03:534,42745,835,56635,622,0001,127,0002,117,632stderr
8Sep 2, 2026 03:534,43045,861,10235,686,0001,086,0002,117,632stderr
9Sep 2, 2026 03:534,43645,214,70735,724,0001,098,0002,117,632stderr