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 listJul 7, 2026 04:02wnwnScore: 3,331Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2026 04:023,28735,263,97926,280,0001,003,0002,113,536
2Jul 7, 2026 04:023,29735,371,84826,357,0001,016,0002,113,536
3Jul 7, 2026 04:023,30335,296,31726,399,0001,020,0002,113,536
4Jul 7, 2026 04:023,31735,353,68626,524,0001,008,0002,113,536
5Jul 7, 2026 04:023,33135,671,30426,619,0001,034,0002,113,536
6Jul 7, 2026 04:023,46337,206,45027,721,0001,030,0002,113,536
7Jul 7, 2026 04:023,48437,452,21527,917,0001,007,0002,113,536
8Jul 7, 2026 04:023,49236,794,42127,950,0001,039,0002,113,536
9Jul 7, 2026 04:023,52239,088,49828,213,0001,026,0002,113,536