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 listAug 11, 2025 03:31RyhbtRyhbtScore: 56,583Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 11, 2025 03:3156,542496,240,610469,297,00002,527,232
2Aug 11, 2025 03:2156,562498,595,120469,464,00002,523,136
3Aug 11, 2025 03:2156,581496,133,851468,622,000999,0002,420,736
4Aug 11, 2025 03:3156,583497,152,867465,639,0003,996,0002,420,736
5Aug 11, 2025 03:3156,583489,735,998468,639,000999,0002,527,232
6Aug 11, 2025 03:2156,597491,721,446467,760,0001,998,0002,527,232