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 listJul 18, 2026 16:34Kevin HeaveyKevin HeaveyScore: 3,890Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 18, 2026 16:423,63147,841,16428,996,0001,147,0002,113,536
2Jul 18, 2026 16:423,71440,446,50229,677,0001,152,0002,113,536
3Jul 18, 2026 16:423,74447,581,70130,041,0001,042,0002,113,536
4Jul 18, 2026 16:423,88041,837,36831,167,0001,039,0002,113,536
5Jul 18, 2026 16:423,89042,543,63531,142,0001,147,0002,113,536
6Jul 18, 2026 16:423,90642,152,23831,283,0001,144,0002,113,536
7Jul 18, 2026 16:423,94643,010,48031,594,0001,164,0002,113,536
8Jul 18, 2026 16:423,95643,043,63631,659,0001,182,0002,113,536
9Jul 18, 2026 16:424,06154,194,47532,577,0001,136,0002,117,632