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 listJun 19, 2025 07:56SherzodSherzodScore: 265,213Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 19, 2025 07:56264,7872,226,979,2562,099,793,00097,943,0002,461,696
2Jun 19, 2025 07:56264,7892,220,202,2692,105,798,00091,947,0002,322,432
3Jun 19, 2025 07:56265,1052,231,118,9432,105,401,00094,972,0002,322,432
4Jun 19, 2025 07:56265,1392,222,523,7962,101,715,00098,939,0002,322,432
5Jun 19, 2025 07:56265,2132,231,299,2602,098,351,000102,919,0002,322,432
6Jun 19, 2025 07:56265,3122,226,326,1112,103,133,00098,959,0002,322,432
7Jun 19, 2025 07:56265,3692,232,297,9462,098,631,000103,932,0002,465,792
8Jun 19, 2025 07:56265,6202,236,634,6822,096,715,000107,933,0002,473,984
9Jun 19, 2025 07:56266,0902,239,447,7352,096,624,000111,926,0002,322,432