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 15:55Karthik 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 15:550423,926,731413,793,0001,030,0002,113,536expected "53683218601332933 ", got "2591 2576 2579 2581 2573 2578 2578 2578 2582 2587 2570 2576 2578 2577 2576 2580 "
2Oct 2, 2026 15:550423,341,713413,144,0001,093,0002,113,536expected "53686848138580920 ", got "2590 2569 2588 2572 2567 2589 2575 2571 2574 2570 2567 2572 2574 2585 2575 2570 "
3Oct 2, 2026 15:550424,944,673414,730,0001,119,0002,113,536expected "53679715840884090 ", got "2596 2579 2581 2577 2578 2581 2580 2582 2584 2581 2582 2616 2589 2592 2582 2582 "