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 listMay 7, 2026 10:55wnwnScore: 3,519Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 7, 2026 10:553,38244,883,58027,017,0001,057,0002,494,464
2May 7, 2026 10:553,38444,049,07627,029,0001,061,0002,482,176
3May 7, 2026 10:553,39346,443,33927,117,0001,049,0002,490,368
4May 7, 2026 10:553,39746,382,08027,130,0001,071,0002,494,464
5May 7, 2026 10:553,51944,077,46228,139,0001,071,0002,490,368
6May 7, 2026 10:553,52245,337,75028,124,0001,110,0002,482,176
7May 7, 2026 10:553,52847,389,13628,147,0001,140,0002,478,080
8May 7, 2026 10:553,53442,047,26828,268,0001,070,0002,482,176
9May 7, 2026 10:553,59047,940,95228,665,0001,133,0002,494,464