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 listOct 29, 2025 13:41Anton RazmakhninAnton RazmakhninScore: 365,755Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 29, 2025 13:41365,0103,062,674,7772,910,680,000118,905,0002,510,848
2Oct 29, 2025 13:41365,5653,062,906,2642,920,295,000113,894,0002,351,104
3Oct 29, 2025 13:41365,5653,066,282,7112,924,295,000109,898,0002,469,888
4Oct 29, 2025 13:41365,5913,063,052,8732,914,547,000119,857,0002,408,448
5Oct 29, 2025 13:41365,7553,061,507,8512,937,873,00097,895,0002,498,560
6Oct 29, 2025 13:41365,8723,066,492,0552,909,871,000126,863,0002,478,080
7Oct 29, 2025 13:41366,6623,076,414,0402,910,416,000132,882,0002,351,104
8Oct 29, 2025 13:41366,7833,070,174,1082,923,406,000120,892,0002,351,104
9Oct 29, 2025 13:41372,0493,120,922,8492,981,110,000106,896,0002,387,968