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 19, 2026 15:40Kevin HeaveyKevin HeaveyScore: 7,545Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 19, 2026 15:417,40270,946,73660,265,0001,174,0002,113,536
2Jul 19, 2026 15:417,51472,018,15561,168,0001,200,0002,113,536
3Jul 19, 2026 15:417,53472,110,07561,369,0001,170,0002,113,536
4Jul 19, 2026 15:417,53772,187,25861,343,0001,221,0002,113,536
5Jul 19, 2026 15:417,54572,174,23261,430,0001,194,0002,113,536
6Jul 19, 2026 15:417,55272,283,61761,502,0001,182,0002,113,536
7Jul 19, 2026 15:417,56272,330,96761,574,0001,194,0002,113,536
8Jul 19, 2026 15:417,57072,565,05561,652,0001,182,0002,113,536
9Jul 19, 2026 15:417,60772,759,20761,949,0001,192,0002,113,536