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 23, 2026 20:09Victor MerckléVictor MerckléScore: 3,795Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 23, 2026 20:093,75339,810,18930,029,0001,123,0002,117,632stderr
2Aug 23, 2026 20:093,76940,309,27830,166,0001,118,0002,117,632stderr
3Aug 23, 2026 20:093,78039,725,78530,279,0001,099,0002,117,632stderr
4Aug 23, 2026 20:093,78840,659,15730,372,0001,072,0002,117,632stderr
5Aug 23, 2026 20:093,79539,858,84630,277,0001,224,0002,117,632stderr
6Aug 23, 2026 20:093,82640,181,32030,623,0001,133,0002,117,632stderr
7Aug 23, 2026 20:093,85540,373,51930,876,0001,126,0002,117,632stderr
8Aug 23, 2026 20:093,86440,448,53730,982,0001,091,0002,117,632stderr
9Aug 23, 2026 20:094,04641,978,12332,397,0001,189,0002,117,632stderr