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 listOct 1, 2026 01:13Karthik ReddyKarthik ReddyScore: 3,459Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 1, 2026 01:133,42937,312,51727,417,0001,044,0002,113,536
2Oct 1, 2026 01:133,44537,497,22527,545,0001,052,0002,113,536
3Oct 1, 2026 01:133,44637,422,53127,578,0001,024,0002,113,536
4Oct 1, 2026 01:133,45437,530,50227,552,0001,120,0002,113,536
5Oct 1, 2026 01:133,45937,605,17827,580,0001,137,0002,113,536
6Oct 1, 2026 01:133,46137,751,11727,560,0001,173,0002,113,536
7Oct 1, 2026 01:133,46337,461,24927,609,0001,140,0002,113,536
8Oct 1, 2026 01:133,46637,628,08527,666,0001,106,0002,113,536
9Oct 1, 2026 01:133,46637,641,47227,661,0001,113,0002,113,536