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 03:50CheckHarryCheckHarryScore: 3,841Success
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 03:513,83241,726,40430,793,0001,015,0002,113,536
2Sep 6, 2026 03:513,83441,730,40130,818,0001,010,0002,113,536
3Sep 6, 2026 03:513,83441,636,80330,802,0001,027,0002,113,536
4Sep 6, 2026 03:513,83841,787,36330,846,0001,012,0002,113,536
5Sep 6, 2026 03:513,84141,703,31530,872,0001,012,0002,113,536
6Sep 6, 2026 03:513,84445,695,56330,901,0001,012,0002,113,536
7Sep 6, 2026 03:513,84541,939,06730,904,0001,013,0002,113,536
8Sep 6, 2026 03:513,85441,831,20630,978,0001,011,0002,113,536
9Sep 6, 2026 03:513,89842,311,30731,335,0001,020,0002,113,536