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 5, 2025 23:26Leon ZhaoLeon ZhaoScore: 57,986Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 5, 2025 23:2657,973504,405,659480,173,0001,000,0002,510,848
2Aug 5, 2025 23:2657,974507,673,623481,181,00002,256,896
3Aug 5, 2025 23:2657,976512,971,164477,201,0004,001,0002,510,848
4Aug 5, 2025 23:2657,976503,701,340480,200,0001,000,0002,400,256
5Aug 5, 2025 23:2657,986501,198,276481,287,00002,519,040
6Aug 5, 2025 23:2657,988510,869,144480,298,0001,000,0002,260,992
7Aug 5, 2025 23:2657,988502,777,593480,304,0001,000,0002,510,848
8Aug 5, 2025 23:2657,993505,726,505481,340,00002,519,040
9Aug 5, 2025 23:2658,001504,984,753479,404,0002,001,0002,387,968