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 5, 2026 17:40CheckHarryCheckHarryScore: 4,260Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 5, 2026 17:484,23845,116,03234,162,0001,016,0002,113,536
2Sep 5, 2026 17:484,24145,097,12634,158,0001,044,0002,113,536
3Sep 5, 2026 17:484,24344,988,29134,201,0001,017,0002,113,536
4Sep 5, 2026 17:484,25645,222,20834,289,0001,037,0002,113,536
5Sep 5, 2026 17:484,26046,470,29434,332,0001,026,0002,113,536
6Sep 5, 2026 17:484,26445,238,50834,351,0001,041,0002,113,536
7Sep 5, 2026 17:484,43646,747,50735,800,0001,025,0002,113,536
8Sep 5, 2026 17:484,44446,704,35335,846,0001,041,0002,113,536
9Sep 5, 2026 17:484,46646,976,51836,035,0001,041,0002,113,536