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 6, 2026 11:54CheckHarryCheckHarryScore: 3,825Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 6, 2026 11:583,80841,430,95830,597,0001,011,0002,113,536
2Sep 6, 2026 11:583,81941,517,67830,693,0001,010,0002,113,536
3Sep 6, 2026 11:583,82141,666,53530,704,0001,014,0002,113,536
4Sep 6, 2026 11:583,82141,581,06130,705,0001,013,0002,113,536
5Sep 6, 2026 11:583,82541,661,40530,740,0001,010,0002,113,536
6Sep 6, 2026 11:583,83541,724,98430,825,0001,012,0002,113,536
7Sep 6, 2026 11:583,88542,142,13031,238,0001,012,0002,113,536
8Sep 6, 2026 11:583,88742,188,86531,251,0001,019,0002,113,536
9Sep 6, 2026 11:583,94642,620,73631,739,0001,014,0002,113,536