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 19, 2025 16:15limanjun99limanjun99Score: 23,686Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 19, 2025 16:1523,685231,261,632195,583,0001,002,0002,269,184
2Sep 19, 2025 16:1523,686222,755,607195,591,0001,003,0002,269,184
3Sep 19, 2025 16:1523,699228,090,076194,705,0001,996,0002,289,664