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:27Karthik 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:2701,215,390,5201,159,890,00046,356,0002,113,536expected "53688255635810901 ", got "2633 2541 2592 2538 2592 2538 2592 2540 "
2Oct 2, 2026 11:2701,214,683,5951,160,155,00045,423,0002,113,536expected "53688151397456608 ", got "2638 2544 2597 2545 2596 2545 2597 2545 "
3Oct 2, 2026 11:2701,214,872,5511,159,953,00045,833,0002,113,536expected "53686467411129446 ", got "2635 2542 2592 2543 2592 2545 2591 2544 "