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 listAug 21, 2025 09:44Asset MalikAsset MalikScore: 89,858Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 21, 2025 09:4489,564768,066,678517,567,000225,811,0002,469,888
2Aug 21, 2025 09:4489,630776,139,355516,257,000227,672,0002,334,720
3Aug 21, 2025 09:4489,781770,711,787517,432,000227,750,0002,445,312
4Aug 21, 2025 09:4489,856773,441,581516,172,000229,632,0002,473,984
5Aug 21, 2025 09:4489,858770,664,869517,185,000228,639,0002,285,568
6Aug 21, 2025 09:4489,941769,702,975517,663,000228,851,0002,449,408
7Aug 21, 2025 09:4490,239775,310,963517,297,000231,685,0002,293,760
8Aug 21, 2025 09:4490,312775,409,816518,716,000230,873,0002,281,472
9Aug 21, 2025 09:4491,552791,133,933516,917,000242,961,0002,478,080