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:09sheryllynn24sheryllynn24Score: 9,850Success
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:099,526108,872,32777,061,0002,001,0002,285,568
2Sep 20, 2025 20:099,527105,321,80477,073,0002,001,0002,265,088
3Sep 20, 2025 20:099,527112,322,40177,075,0002,001,0002,285,568
4Sep 20, 2025 20:099,850106,979,55679,760,0001,994,0002,285,568
5Sep 20, 2025 20:099,854108,782,81180,792,000997,0002,265,088
6Sep 20, 2025 20:099,856113,152,99179,808,0001,995,0002,265,088