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 3, 2026 07:19CheckHarryCheckHarryScore: 4,928Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 3, 2026 07:204,84150,376,40339,160,0001,025,0002,113,536
2Sep 3, 2026 07:204,84651,697,52639,199,0001,025,0002,113,536
3Sep 3, 2026 07:204,85751,329,27538,308,0002,006,0002,113,536
4Sep 3, 2026 07:204,86450,317,86338,362,0002,012,0002,113,536
5Sep 3, 2026 07:204,92850,757,38839,883,0001,025,0002,113,536
6Sep 3, 2026 07:204,94750,932,99439,061,0002,006,0002,113,536
7Sep 3, 2026 07:204,99951,250,16840,470,0001,025,0002,113,536
8Sep 3, 2026 07:205,00051,334,86640,476,0001,025,0002,113,536
9Sep 3, 2026 07:205,01852,726,82039,635,0002,022,0002,113,536