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 27, 2026 09:55Victor MerckléVictor MerckléScore: 5,118Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 27, 2026 09:555,03250,848,75840,632,0001,136,0002,113,536
2Aug 27, 2026 09:555,04550,291,92640,783,0001,093,0002,113,536
3Aug 27, 2026 09:555,04950,278,92740,796,0001,116,0002,113,536
4Aug 27, 2026 09:555,08650,555,38741,158,0001,062,0002,113,536
5Aug 27, 2026 09:555,11851,699,39341,384,0001,098,0002,113,536
6Aug 27, 2026 09:555,13050,964,84241,455,0001,126,0002,113,536
7Aug 27, 2026 09:555,16151,242,96241,738,0001,104,0002,113,536
8Aug 27, 2026 09:555,20451,540,97742,130,0001,065,0002,113,536
9Aug 27, 2026 09:555,30152,393,43842,960,0001,043,0002,113,536