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 6, 2026 12:11Kevin HeaveyKevin HeaveyScore: 3,791Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 6, 2026 12:133,56339,577,36628,430,0001,145,0002,113,536
2Sep 6, 2026 12:133,57740,113,11228,541,0001,155,0002,113,536
3Sep 6, 2026 12:133,58339,759,33028,581,0001,160,0002,113,536
4Sep 6, 2026 12:133,65740,330,18529,148,0001,210,0002,113,536
5Sep 6, 2026 12:133,79141,508,84530,316,0001,157,0002,113,536
6Sep 6, 2026 12:133,79141,395,58530,309,0001,162,0002,113,536
7Sep 6, 2026 12:133,83341,856,29730,619,0001,202,0002,113,536
8Sep 6, 2026 12:133,83842,016,48830,622,0001,236,0002,113,536
9Sep 6, 2026 12:133,87442,207,21730,988,0001,170,0002,113,536