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 28, 2026 20:25Victor MerckléVictor MerckléScore: 5,150Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 28, 2026 20:255,12850,862,41841,548,0001,020,0002,117,632stderr
2Aug 28, 2026 20:255,14451,811,83241,676,0001,020,0002,117,632stderr
3Aug 28, 2026 20:255,14651,913,94141,692,0001,020,0002,117,632stderr
4Aug 28, 2026 20:255,14751,753,48241,708,0001,019,0002,117,632stderr
5Aug 28, 2026 20:255,15050,918,51841,706,0001,039,0002,117,632stderr
6Aug 28, 2026 20:255,15951,875,38641,799,0001,022,0002,117,632stderr
7Aug 28, 2026 20:255,15951,863,45241,808,0001,019,0002,117,632stderr
8Aug 28, 2026 20:255,16151,936,30641,821,0001,020,0002,117,632stderr
9Aug 28, 2026 20:255,20752,282,07442,180,0001,039,0002,117,632stderr