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 23, 2026 10:24Kevin HeaveyKevin HeaveyScore: 3,230Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 23, 2026 10:253,22035,768,07825,529,0001,205,0002,113,536
2Sep 23, 2026 10:253,22435,721,00925,567,0001,198,0002,113,536
3Sep 23, 2026 10:253,22835,818,03225,581,0001,216,0002,113,536
4Sep 23, 2026 10:253,23035,870,67425,770,0001,044,0002,113,536
5Sep 23, 2026 10:253,23035,770,51025,604,0001,209,0002,113,536
6Sep 23, 2026 10:253,24937,618,63325,907,0001,060,0002,113,536
7Sep 23, 2026 10:253,25335,969,85325,919,0001,087,0002,113,536
8Sep 23, 2026 10:253,25636,146,07726,005,0001,020,0002,113,536
9Sep 23, 2026 10:253,27836,198,08125,966,0001,248,0002,113,536