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 07:10sheryllynn24sheryllynn24Score: 15,614Success
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 07:1015,566154,721,197127,191,0002,003,0002,285,568
2Sep 20, 2025 07:1015,585155,346,715128,357,0001,002,0002,285,568
3Sep 20, 2025 07:1015,598158,010,344128,459,0001,003,0002,285,568
4Sep 20, 2025 07:1015,608156,798,725128,545,0001,004,0002,285,568
5Sep 20, 2025 07:1015,614158,246,125129,594,00002,523,136
6Sep 20, 2025 07:1015,617157,182,504128,616,0001,004,0002,285,568
7Sep 20, 2025 07:1015,632155,636,936128,746,000998,0002,285,568
8Sep 20, 2025 07:1015,632154,591,489129,744,00002,265,088
9Sep 20, 2025 07:1015,640160,621,246128,814,000998,0002,285,568