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 25, 2026 12:55Victor MerckléVictor MerckléScore: 4,548Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 25, 2026 12:564,50645,782,22136,394,0001,007,0002,117,632stderr
2Aug 25, 2026 12:564,50846,558,58336,355,0001,063,0002,117,632stderr
3Aug 25, 2026 12:564,53946,145,19836,634,0001,042,0002,117,632stderr
4Aug 25, 2026 12:564,54446,118,27536,686,0001,037,0002,117,632stderr
5Aug 25, 2026 12:564,54846,144,77136,743,0001,008,0002,117,632stderr
6Aug 25, 2026 12:564,56246,222,77236,820,0001,049,0002,117,632stderr
7Aug 25, 2026 12:564,59447,393,14036,967,0001,169,0002,117,632stderr
8Aug 25, 2026 12:564,68047,191,16637,803,0001,044,0002,117,632stderr
9Aug 25, 2026 12:564,78948,119,75538,735,0001,018,0002,117,632stderr