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 15:50Victor MerckléVictor MerckléScore: 3,792Success
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 15:523,76239,610,33330,098,0001,131,0002,117,632stderr
2Aug 12, 2026 15:523,77639,936,72930,186,0001,160,0002,117,632stderr
3Aug 12, 2026 15:523,77739,734,46130,271,0001,081,0002,117,632stderr
4Aug 12, 2026 15:523,78839,836,67730,356,0001,089,0002,117,632stderr
5Aug 12, 2026 15:523,79239,891,74430,370,0001,109,0002,117,632stderr
6Aug 12, 2026 15:523,80239,965,39330,437,0001,126,0002,117,632stderr
7Aug 12, 2026 15:523,81440,109,06630,526,0001,133,0002,117,632stderr
8Aug 12, 2026 15:523,82240,120,38430,633,0001,093,0002,117,632stderr
9Aug 12, 2026 15:523,93241,059,96931,439,0001,199,0002,117,632stderr