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 listFeb 18, 2025 11:40AlexAlexScore: 43,885Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 18, 2025 11:4043,779384,991,479362,362,0001,001,0002,273,280
2Feb 18, 2025 11:4043,780386,932,956362,374,0001,001,0002,265,088
3Feb 18, 2025 11:4043,829388,316,956361,781,0001,998,0002,293,760
4Feb 18, 2025 11:4043,842393,229,434360,893,0002,999,0002,277,376
5Feb 18, 2025 11:4043,885391,214,827361,245,0003,002,0002,293,760
6Feb 18, 2025 11:4044,415398,257,335367,643,000999,0002,269,184
7Feb 18, 2025 11:4044,938395,164,389369,989,0002,999,0002,383,872
8Feb 18, 2025 11:4044,945401,011,950371,044,0002,000,0002,277,376
9Feb 18, 2025 11:4044,972403,723,939372,268,0001,000,0002,269,184