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 09:14Kevin HeaveyKevin HeaveyScore: 3,542Success
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 09:173,52937,649,95628,258,0001,034,0002,113,536
2Sep 6, 2026 09:173,53437,671,52828,112,0001,221,0002,113,536
3Sep 6, 2026 09:173,53737,654,23028,156,0001,202,0002,113,536
4Sep 6, 2026 09:173,53837,684,46028,162,0001,206,0002,113,536
5Sep 6, 2026 09:173,54237,723,55828,218,0001,188,0002,113,536
6Sep 6, 2026 09:173,54637,742,61828,394,0001,041,0002,113,536
7Sep 6, 2026 09:173,75539,593,50429,983,0001,188,0002,113,536
8Sep 6, 2026 09:173,83740,130,35730,818,0001,034,0002,113,536
9Sep 6, 2026 09:173,87040,466,46430,903,0001,222,0002,113,536