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 06:26Karthik 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 06:260325,780,236315,553,0001,174,0002,113,536expected "53680081144937583 ", got "2724 27 999|2611,55 2610,55 2621,55 2620,55 2624,55 2625,55 2618,55 2618,54 2610,53 2611,54 |2534|201 "
2Oct 2, 2026 06:260324,577,033314,373,0001,127,0002,113,536expected "53693156559632622 ", got "2707 26 999|2603,53 2604,53 2609,54 2607,54 2613,55 2613,54 2611,54 2609,52 2601,53 2601,53 |2528|139 "
3Oct 2, 2026 06:260325,582,366315,374,0001,161,0002,113,536expected "53685168474109689 ", got "2709 26 999|2609,55 2609,55 2615,55 2620,56 2624,56 2625,56 2619,56 2622,55 2612,56 2609,55 |2530|32 "