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 12, 2026 08:04Victor MerckléVictor MerckléScore: 3,805Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 12, 2026 08:053,77239,759,02930,228,0001,086,0002,117,632stderr
2Aug 12, 2026 08:053,78739,881,74930,350,0001,084,0002,117,632stderr
3Aug 12, 2026 08:053,78939,921,20830,305,0001,149,0002,117,632stderr
4Aug 12, 2026 08:053,79539,928,05730,366,0001,133,0002,117,632stderr
5Aug 12, 2026 08:053,80540,003,48430,461,0001,126,0002,117,632stderr
6Aug 12, 2026 08:053,81040,032,04730,490,0001,135,0002,117,632stderr
7Aug 12, 2026 08:053,81139,991,21830,557,0001,076,0002,117,632stderr
8Aug 12, 2026 08:053,81440,031,35330,508,0001,152,0002,117,632stderr
9Aug 12, 2026 08:053,82040,089,95430,497,0001,212,0002,117,632stderr