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 18, 2025 16:24Andy BlairAndy BlairScore: 176,401Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 18, 2025 16:24175,9421,487,371,5371,368,364,00091,957,0002,322,432
2Jun 18, 2025 16:24176,1881,491,568,0711,369,405,00092,959,0002,478,080
3Jun 18, 2025 16:24176,2261,489,081,8311,362,767,00099,909,0002,478,080
4Jun 18, 2025 16:24176,2421,488,399,8161,370,822,00091,988,0002,478,080
5Jun 18, 2025 16:24176,4011,490,351,0981,397,172,00066,960,0002,318,336
6Jun 18, 2025 16:24176,4611,488,230,1611,371,649,00092,976,0002,318,336
7Jun 18, 2025 16:24176,4851,496,899,7041,376,835,00087,989,0002,322,432
8Jun 18, 2025 16:24176,7141,496,918,3711,362,818,000103,909,0002,478,080
9Jun 18, 2025 16:24176,7711,493,793,7571,369,257,00097,946,0002,322,432