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:56Karthik 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:570237,742,664227,475,0001,147,0002,113,536expected "53679222556389211 ", got "2602 2537 2446|2575 2539 2446|2571 2538 2445|245 "
2Oct 2, 2026 11:570237,366,926227,212,0001,098,0002,113,536expected "53691642774588582 ", got "2605 2534 2441|2568 2533 2442|2567 2533 2441|191 "
3Oct 2, 2026 11:570237,748,726227,619,0001,106,0002,113,536expected "53688603481901156 ", got "2595 2541 2448|2571 2540 2450|2569 2542 2450|31 "