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 listAug 18, 2025 13:02Ashish AhujaAshish AhujaScore: 11,168Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 18, 2025 13:0211,040116,814,48384,659,0006,971,0002,281,472
2Aug 18, 2025 13:0211,068116,872,04585,875,0005,991,0002,383,872
3Aug 18, 2025 13:0211,073116,787,16683,912,0007,991,0002,306,048
4Aug 18, 2025 13:0211,168115,855,81586,712,0005,980,0002,293,760
5Aug 18, 2025 13:0211,173116,787,61885,755,0006,980,0002,277,376
6Aug 18, 2025 13:0211,328119,855,01689,018,0005,001,0002,347,008