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 11:26Karthik 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 11:270748,132,753693,289,00045,291,0002,113,536expected "53690413923358562 ", got "2629 2544 2586 2542 2612 2552 2591 2545 "
2Oct 2, 2026 11:270748,361,728693,432,00045,924,0002,113,536expected "53689562045543938 ", got "2634 2548 2595 2548 2594 2548 2592 2547 "
3Oct 2, 2026 11:270767,918,821693,921,00064,919,0002,113,536expected "53687807751932289 ", got "2636 2565 2597 2550 2595 2550 2597 2552 "