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 11:22Karthik 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 11:220220,390,828208,920,0001,146,0002,113,536expected "53683214809587935 ", got "2636 2595 2610 2597 2609 2594 2609 2594 "
2Oct 2, 2026 11:220219,150,841208,958,0001,142,0002,113,536expected "53679742548903666 ", got "2636 2595 2609 2593 2618 2593 2609 2595 "
3Oct 2, 2026 11:220219,311,579209,022,0001,147,0002,113,536expected "53684379898038201 ", got "2639 2594 2608 2595 2611 2594 2616 2596 "