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 listApr 17, 2026 13:22wnwnScore: 11,103Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 17, 2026 13:2211,074113,799,14389,915,0001,998,0002,523,136
2Apr 17, 2026 13:2211,080117,083,83989,966,0001,999,0002,523,136
3Apr 17, 2026 13:2211,085119,911,07890,003,0002,000,0002,265,088
4Apr 17, 2026 13:2211,103116,284,35090,153,0002,003,0002,293,760
5Apr 17, 2026 13:2211,104115,150,22891,159,0001,001,0002,293,760
6Apr 17, 2026 13:2211,251114,696,62992,379,0001,004,0002,293,760