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 listOct 2, 2026 19:19Karthik ReddyKarthik ReddyError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 2, 2026 19:190254,313,206241,460,0003,770,00020,480expected "53691300218403104 ", got "2605 3425 2588 3428 2591 3426 2590 3441 "
2Oct 2, 2026 19:190255,973,054243,063,0003,903,00020,480expected "53688345983314951 ", got "2620 3450 2604 3452 2604 3451 2605 3453 "
3Oct 2, 2026 19:190254,802,038241,879,0003,908,00020,480expected "53687010219903723 ", got "2620 3428 2597 3427 2598 3427 2597 3428 "