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 15:27Kevin HeaveyKevin HeaveyScore: 3,831Success
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 15:303,52337,606,53928,035,0001,213,0002,113,536
2Sep 6, 2026 15:303,68038,962,65829,360,0001,188,0002,113,536
3Sep 6, 2026 15:303,71539,253,07829,654,0001,188,0002,113,536
4Sep 6, 2026 15:303,77039,669,95930,097,0001,197,0002,113,536
5Sep 6, 2026 15:303,83140,723,36930,593,0001,207,0002,113,536
6Sep 6, 2026 15:303,84840,715,34430,757,0001,186,0002,113,536
7Sep 6, 2026 15:303,84940,457,81930,735,0001,216,0002,113,536
8Sep 6, 2026 15:303,90240,884,46631,191,0001,197,0002,113,536
9Sep 6, 2026 15:303,92040,765,15631,504,0001,033,0002,113,536