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 20, 2025 20:20sheryllynn24sheryllynn24Score: 9,976Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 20, 2025 20:209,530103,377,43177,095,0002,002,0002,281,472
2Sep 20, 2025 20:209,533106,193,66777,122,0002,003,0002,281,472
3Sep 20, 2025 20:209,543102,222,85878,207,0001,002,0002,527,232
4Sep 20, 2025 20:209,976109,431,08980,806,0001,995,0002,281,472
5Sep 20, 2025 20:209,976110,787,33280,808,0001,995,0002,514,944
6Sep 20, 2025 20:2010,002108,942,80781,015,0002,000,0002,527,232