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 15, 2025 20:39Valentin KofmanValentin KofmanScore: 7,165Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 15, 2025 20:396,00776,452,99546,869,0002,991,0002,277,376
2Jul 15, 2025 20:396,01973,329,73347,960,0001,998,0002,277,376
3Jul 15, 2025 20:396,05480,182,22148,242,0002,010,0002,383,872
4Jul 15, 2025 20:397,16585,620,77257,455,0002,015,0002,277,376
5Jul 15, 2025 20:397,17988,412,32957,566,0002,019,0002,265,088
6Jul 15, 2025 20:397,18392,893,70357,596,0002,020,0002,277,376