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 24, 2026 20:49Victor MerckléVictor MerckléScore: 3,782Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 24, 2026 20:493,74540,158,45029,972,0001,119,0002,117,632stderr
2Aug 24, 2026 20:493,76740,988,78230,170,0001,100,0002,117,632stderr
3Aug 24, 2026 20:493,77839,726,37030,228,0001,133,0002,117,632stderr
4Aug 24, 2026 20:493,77939,741,29730,281,0001,088,0002,117,632stderr
5Aug 24, 2026 20:493,78239,726,73030,325,0001,068,0002,117,632stderr
6Aug 24, 2026 20:493,78339,735,25030,240,0001,166,0002,117,632stderr
7Aug 24, 2026 20:493,78640,335,98230,297,0001,134,0002,117,632stderr
8Aug 24, 2026 20:493,79139,884,74330,381,0001,086,0002,117,632stderr
9Aug 24, 2026 20:494,04941,955,07132,540,0001,072,0002,117,632stderr