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 listMay 28, 2026 12:51Innokentii MeleshchenkoInnokentii MeleshchenkoScore: 237,693Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 28, 2026 12:51237,1131,978,082,8621,903,953,00064,089,0002,117,632
2May 28, 2026 12:51237,4551,980,346,7511,905,810,00065,070,0002,117,632
3May 28, 2026 12:51237,4801,982,002,9611,906,039,00065,051,0002,117,632
4May 28, 2026 12:51237,5941,983,385,8181,905,967,00066,066,0002,117,632
5May 28, 2026 12:51237,6931,982,716,7151,906,599,00066,259,0002,117,632
6May 28, 2026 12:51238,1411,985,906,8531,910,471,00066,100,0002,117,632
7May 28, 2026 12:51238,3841,991,299,7481,913,398,00065,193,0002,117,632
8May 28, 2026 12:51238,5771,990,236,0421,914,144,00066,052,0002,117,632
9May 28, 2026 12:51239,1661,997,720,7501,916,996,00068,087,0002,117,632