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 7, 2026 19:54Kevin HeaveyKevin HeaveyScore: 4,339Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2026 19:554,23045,230,28833,948,0001,168,0002,117,632
2Jul 7, 2026 19:554,24345,085,28434,022,0001,195,0002,117,632
3Jul 7, 2026 19:554,24844,720,42934,053,0001,206,0002,117,632
4Jul 7, 2026 19:554,28445,078,27734,380,0001,184,0002,117,632
5Jul 7, 2026 19:554,33945,784,63734,998,0001,016,0002,117,632
6Jul 7, 2026 19:554,35245,674,60734,904,0001,219,0002,117,632
7Jul 7, 2026 19:554,40146,077,74835,386,0001,143,0002,117,632
8Jul 7, 2026 19:554,48246,745,20036,037,0001,167,0002,117,632
9Jul 7, 2026 19:554,51847,003,43436,324,0001,177,0002,117,632