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 26, 2026 20:40Victor MerckléVictor MerckléScore: 7,319Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 26, 2026 20:417,27869,528,66659,231,0001,178,0002,117,632stderr
2Aug 26, 2026 20:417,28768,691,12759,282,0001,203,0002,117,632stderr
3Aug 26, 2026 20:417,30969,733,49859,524,0001,147,0002,117,632stderr
4Aug 26, 2026 20:417,30969,002,67459,527,0001,140,0002,117,632stderr
5Aug 26, 2026 20:417,31969,848,14859,612,0001,139,0002,117,632stderr
6Aug 26, 2026 20:417,33569,258,49659,733,0001,149,0002,117,632stderr
7Aug 26, 2026 20:417,35869,522,62759,930,0001,148,0002,117,632stderr
8Aug 26, 2026 20:417,36469,537,26859,868,0001,254,0002,117,632stderr
9Aug 26, 2026 20:417,52671,469,49261,385,0001,084,0002,117,632stderr