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 listJan 30, 2026 20:01olliecrowolliecrowScore: 11,776Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 30, 2026 20:0111,602125,021,47694,292,0002,006,0002,277,376
2Jan 30, 2026 20:0111,734118,321,29794,377,0003,012,0002,285,568
3Jan 30, 2026 20:0111,754123,137,48695,548,0002,011,0002,281,472
4Jan 30, 2026 20:0111,776129,556,84293,755,0003,989,0002,285,568
5Jan 30, 2026 20:0111,786124,973,78796,823,000998,0002,506,752
6Jan 30, 2026 20:0111,797123,851,19195,918,0001,998,0002,519,040