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:14Karthik 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:140243,916,364233,737,0001,095,0002,113,536expected "53691082884022494 ", got "2596 2600 2589 2574 2599 2594 2572 2601 2590 "
2Oct 2, 2026 15:140244,239,761234,069,0001,135,0002,113,536expected "53690271737191072 ", got "2666 2590 2585 2579 2592 2583 2577 2591 2593 "
3Oct 2, 2026 15:140243,492,564233,406,0001,097,0002,113,536expected "53689808989035182 ", got "2615 2589 2584 2572 2590 2586 2575 2591 2582 "