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 listFeb 21, 2026 15:57Juraj ZelmanJuraj ZelmanScore: 7,810Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 21, 2026 15:577,69490,597,37561,864,0001,995,0002,371,584
2Feb 21, 2026 15:577,69488,873,45361,866,0001,995,0002,359,296
3Feb 21, 2026 15:577,70289,648,65361,931,0001,997,0002,367,488
4Feb 21, 2026 15:577,78091,775,76463,566,0001,008,0002,293,760
5Feb 21, 2026 15:577,78391,825,75364,596,00002,359,296
6Feb 21, 2026 15:577,79293,616,99463,663,0001,010,0002,293,760
7Feb 21, 2026 15:577,81091,332,72262,827,0001,994,0002,293,760
8Feb 21, 2026 15:577,81491,177,96962,859,0001,995,0002,371,584
9Feb 21, 2026 15:577,81787,647,18462,885,0001,996,0002,293,760
10Feb 21, 2026 15:577,82188,761,57763,915,000998,0002,293,760
11Feb 21, 2026 15:577,82496,689,50163,937,000999,0002,359,296
12Feb 21, 2026 15:577,83291,330,47663,003,0002,000,0002,293,760