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:50sheryllynn24sheryllynn24Score: 9,618Success
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:509,062103,197,32573,209,0002,005,0002,523,136
2Sep 20, 2025 20:509,064107,585,19474,231,0001,003,0002,285,568
3Sep 20, 2025 20:509,173106,994,05074,131,0002,003,0002,285,568
4Sep 20, 2025 20:509,618106,342,33377,836,0001,995,0002,523,136
5Sep 20, 2025 20:509,621106,867,50477,856,0001,996,0002,285,568
6Sep 20, 2025 20:509,649106,802,15079,087,0001,001,0002,506,752