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 21:44Victor MerckléVictor MerckléScore: 6,403Success
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 21:456,20559,673,11431,716,00019,789,0002,117,632stderr
2Aug 26, 2026 21:456,24360,261,00531,882,00019,940,0002,117,632stderr
3Aug 26, 2026 21:456,26060,409,95632,128,00019,831,0002,117,632stderr
4Aug 26, 2026 21:456,35561,006,41332,856,00019,892,0002,117,632stderr
5Aug 26, 2026 21:456,40361,321,90133,358,00019,791,0002,117,632stderr
6Aug 26, 2026 21:456,46462,026,31533,634,00020,020,0002,117,632stderr
7Aug 26, 2026 21:456,47362,844,57833,880,00019,853,0002,117,632stderr
8Aug 26, 2026 21:456,49862,124,82734,045,00019,893,0002,117,632stderr
9Aug 26, 2026 21:456,50462,576,90234,054,00019,934,0002,117,632stderr