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:550477,965,154467,695,0001,199,0002,113,536expected "53683942199903198 ", got "2593 2582 2576 2593 2583 2576 2574 2582 2575 2587 2584 2577 2582 2651 2671 2591 2596 2575 "
2Oct 2, 2026 15:550477,956,268467,801,0001,037,0002,113,536expected "53684132903632088 ", got "2590 2580 2572 2571 2580 2572 2573 2600 2575 2579 2582 2570 2586 2662 2683 2595 2607 2570 "
3Oct 2, 2026 15:550477,845,697467,461,0001,186,0002,113,536expected "53688495088308921 ", got "2591 2578 2576 2570 2575 2576 2569 2576 2611 2579 2581 2573 2578 2645 2659 2592 2613 2592 "