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 6, 2026 10:29Kevin HeaveyKevin HeaveyScore: 9,174Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 6, 2026 10:309,10086,619,79574,420,0001,112,0002,121,728stderr
2Jul 6, 2026 10:309,13485,360,88374,747,0001,066,0002,121,728stderr
3Jul 6, 2026 10:309,14185,426,86574,846,0001,026,0002,121,728stderr
4Jul 6, 2026 10:309,15785,561,03174,983,0001,025,0002,121,728stderr
5Jul 6, 2026 10:309,17485,699,94975,014,0001,132,00028,672stderr
6Jul 6, 2026 10:309,61889,395,72278,773,0001,057,0002,121,728stderr
7Jul 6, 2026 10:3010,05593,035,27074,688,0008,774,0002,121,728stderr
8Jul 6, 2026 10:3010,21794,395,37074,944,0009,865,0002,121,728stderr
9Jul 6, 2026 10:3013,409303,438,70976,841,00034,455,0002,121,728stderr