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 28, 2025 07:50sheryllynn24sheryllynn24Score: 6,175Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 28, 2025 07:506,02879,196,99049,034,0001,000,0002,285,568
2Sep 28, 2025 07:506,11078,657,65949,716,000994,0002,285,568
3Sep 28, 2025 07:506,14576,959,13949,007,0002,000,0002,265,088
4Sep 28, 2025 07:506,17575,556,49349,241,0002,009,0002,285,568
5Sep 28, 2025 07:506,18980,136,62750,365,0001,007,0002,367,488
6Sep 28, 2025 07:506,35083,313,35651,695,0001,013,0002,285,568