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 26, 2025 18:03sheryllynn24sheryllynn24Score: 7,213Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 26, 2025 18:037,04980,745,01056,493,0002,017,0002,285,568
2Sep 26, 2025 18:037,05883,585,21357,571,0001,010,0002,285,568
3Sep 26, 2025 18:037,07485,003,10957,702,0001,012,0002,265,088
4Sep 26, 2025 18:037,21386,189,20757,876,0001,995,0002,265,088
5Sep 26, 2025 18:037,22287,229,99857,947,0001,998,0002,285,568
6Sep 26, 2025 18:037,23985,875,72658,085,0002,002,0002,265,088