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 08:16sheryllynn24sheryllynn24Score: 11,697Success
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 08:1611,544127,303,39894,814,000998,0002,265,088
2Sep 20, 2025 08:1611,545129,233,74393,827,0001,996,0002,510,848
3Sep 20, 2025 08:1611,546123,476,72993,836,0001,996,0002,523,136
4Sep 20, 2025 08:1611,697123,923,42996,081,0001,000,0002,519,040
5Sep 20, 2025 08:1611,734120,799,86496,390,0001,004,0002,375,680
6Sep 20, 2025 08:1611,750120,215,27497,523,00002,260,992