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:47Karthik 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:480246,811,987235,713,0001,002,0002,113,536expected "53688629449879312 ", got "2605 2673 2584 2574 2663 2584 2571 2663 2588 "
2Oct 2, 2026 14:480245,430,448234,860,0001,013,0002,113,536expected "53689941639885811 ", got "2608 2651 2571 2563 2652 2571 2564 2654 2591 "
3Oct 2, 2026 14:480244,681,001234,575,0001,101,0002,113,536expected "53688855195854746 ", got "2593 2650 2574 2571 2648 2572 2571 2647 2574 "