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 17:05Karthik 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 17:060326,527,653312,733,0004,604,00020,480expected "53686904597634921 ", got "2616 2598 2599 2597 2599 2597 2597 2599 2598 2596 2600 2600 "
2Oct 2, 2026 17:060327,313,758313,734,0004,571,00020,480expected "53689474105029092 ", got "2669 2600 2597 2599 2600 2598 2599 2602 2599 2601 2601 2636 "
3Oct 2, 2026 17:060327,477,092313,843,0004,580,00020,480expected "53684010811769304 ", got "2622 2605 2607 2605 2604 2609 2605 2606 2607 2612 2606 2613 "