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 10, 2026 17:32Victor MerckléVictor MerckléScore: 5,943Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 10, 2026 17:345,93257,470,59448,127,0001,111,0002,117,632stderr
2Aug 10, 2026 17:345,93357,559,21348,137,0001,108,0002,117,632stderr
3Aug 10, 2026 17:345,93657,584,86248,268,0001,006,0002,117,632stderr
4Aug 10, 2026 17:345,93757,679,89148,140,0001,138,0002,117,632stderr
5Aug 10, 2026 17:345,94357,574,62848,223,0001,106,0002,117,632stderr
6Aug 10, 2026 17:345,94457,752,45948,238,0001,098,0002,117,632stderr
7Aug 10, 2026 17:345,94757,563,07748,310,0001,057,0002,117,632stderr
8Aug 10, 2026 17:345,98757,869,87348,657,0001,041,0002,117,632stderr
9Aug 10, 2026 17:345,99358,167,16648,715,0001,030,0002,117,632stderr