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:37Kevin HeaveyKevin HeaveyScore: 3,696Success
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:383,53238,001,41728,274,0001,045,0002,113,536
2Sep 6, 2026 10:383,53237,962,31728,099,0001,219,0002,113,536
3Sep 6, 2026 10:383,54138,042,65628,344,0001,049,0002,113,536
4Sep 6, 2026 10:383,64239,031,26128,979,0001,250,0002,113,536
5Sep 6, 2026 10:383,69639,339,66529,635,0001,050,0002,113,536
6Sep 6, 2026 10:383,75939,571,81430,163,0001,039,0002,113,536
7Sep 6, 2026 10:383,80039,917,00030,469,0001,072,0002,113,536
8Sep 6, 2026 10:383,81240,338,41330,454,0001,187,0002,113,536
9Sep 6, 2026 10:383,83740,469,03630,794,0001,054,0002,113,536