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:18Karthik 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:190295,215,463282,522,0003,646,00020,480expected "53687840320744175 ", got "2604 4455 2587 4453 2586 4453 2588 4451 "
2Oct 2, 2026 19:190286,127,812273,348,0003,716,00020,480expected "53692986245064362 ", got "2621 4203 2607 4203 2608 4206 2608 4205 "
3Oct 2, 2026 19:190295,763,301280,500,0003,814,00020,480expected "53681425157388884 ", got "2610 4402 2586 4402 2585 4401 2587 4401 "