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 04:35CheckHarryCheckHarryScore: 8,284Success
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 04:368,27778,553,58067,546,0001,158,0002,113,536
2Sep 3, 2026 04:368,27778,625,71967,523,0001,178,0002,113,536
3Sep 3, 2026 04:368,28278,614,81767,689,0001,053,0002,113,536
4Sep 3, 2026 04:368,28378,633,21167,594,0001,161,0002,113,536
5Sep 3, 2026 04:368,28478,655,75967,714,0001,050,0002,113,536
6Sep 3, 2026 04:368,28978,560,25767,763,0001,040,0002,113,536
7Sep 3, 2026 04:368,29178,693,95367,752,0001,071,0002,113,536
8Sep 3, 2026 04:368,29978,793,77967,754,0001,131,0002,113,536
9Sep 3, 2026 04:368,30780,044,13667,724,0001,225,0002,113,536