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 17:27sheryllynn24sheryllynn24Score: 6,640Success
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 17:276,50785,285,32852,007,0002,000,0002,285,568
2Sep 26, 2025 17:276,51384,063,52752,053,0002,002,0002,285,568
3Sep 26, 2025 17:276,51780,564,62753,092,0001,001,0002,510,848
4Sep 26, 2025 17:276,64078,561,76753,106,0002,004,0002,523,136
5Sep 26, 2025 17:276,65083,501,30453,188,0002,007,0002,519,040
6Sep 26, 2025 17:276,72281,837,37953,803,0001,992,0002,514,944