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 10:03Kevin HeaveyKevin HeaveyScore: 3,843Success
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 10:053,59839,846,32528,697,0001,167,0002,113,536
2Sep 6, 2026 10:053,74441,098,01229,916,0001,163,0002,113,536
3Sep 6, 2026 10:053,77241,249,04330,163,0001,146,0002,113,536
4Sep 6, 2026 10:053,79441,495,98930,449,0001,043,0002,113,536
5Sep 6, 2026 10:053,84342,025,66430,764,0001,141,0002,113,536
6Sep 6, 2026 10:053,84741,939,21530,796,0001,142,0002,113,536
7Sep 6, 2026 10:053,84842,728,19530,815,0001,127,0002,113,536
8Sep 6, 2026 10:053,85041,898,55830,798,0001,165,0002,113,536
9Sep 6, 2026 10:053,86042,924,83130,837,0001,202,0002,113,536