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 listSep 28, 2026 07:20Karthik ReddyKarthik ReddyScore: 5,212Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 28, 2026 07:205,17453,280,44241,908,0001,038,0002,113,536
2Sep 28, 2026 07:205,17653,264,80741,928,0001,039,0002,113,536
3Sep 28, 2026 07:205,18053,235,82141,980,0001,022,0002,113,536
4Sep 28, 2026 07:205,19053,330,81042,014,0001,069,0002,113,536
5Sep 28, 2026 07:205,21253,551,01242,232,0001,031,0002,113,536
6Sep 28, 2026 07:205,22153,714,11642,293,0001,044,0002,113,536
7Sep 28, 2026 07:205,23053,781,03042,367,0001,044,0002,113,536
8Sep 28, 2026 07:205,23653,731,10542,433,0001,030,0002,113,536
9Sep 28, 2026 07:205,36154,881,11143,464,0001,035,0002,113,536