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 02:27CheckHarryCheckHarryScore: 4,204Success
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 02:294,19244,714,21333,769,0001,025,0002,113,536
2Sep 6, 2026 02:294,19844,717,42033,830,0001,016,0002,113,536
3Sep 6, 2026 02:294,19944,703,92333,672,0001,187,0002,113,536
4Sep 6, 2026 02:294,19945,766,41233,831,0001,026,0002,113,536
5Sep 6, 2026 02:294,20444,844,18033,892,0001,008,0002,113,536
6Sep 6, 2026 02:294,20644,860,34333,845,0001,072,0002,113,536
7Sep 6, 2026 02:294,21144,839,68133,927,0001,027,0002,113,536
8Sep 6, 2026 02:294,21644,916,59433,804,0001,195,0002,113,536
9Sep 6, 2026 02:294,22044,878,26934,007,0001,022,0002,113,536