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 13, 2025 19:51Tony SolomonikTony SolomonikScore: 76,767Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 13, 2025 19:5176,676661,952,971572,470,00063,940,0002,424,832
2Sep 13, 2025 19:5176,767667,178,716572,153,00065,017,0002,285,568
3Sep 13, 2025 19:5177,505669,913,224575,260,00068,030,0002,285,568