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 14:52Karthik 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 14:520366,509,486355,708,0001,011,0002,113,536expected "53691614877939699 ", got "2587 2563 2568 2567 2652 2545 2608 2437 2436 2476 2562 2569 2437 2477 255 "
2Oct 2, 2026 14:520366,904,039356,819,0001,094,0002,113,536expected "53697701268352400 ", got "2593 2572 2580 2578 2661 2554 2616 2445 2427 2484 2574 2584 2443 2485 156 "
3Oct 2, 2026 14:520366,359,397356,246,0001,075,0002,113,536expected "53681205759624987 ", got "2597 2568 2574 2573 2659 2549 2607 2441 2422 2482 2568 2573 2441 2483 168 "