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 07:44Karthik 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 07:450376,366,002366,224,0001,060,0002,113,536expected "53684490038148479 ", got "2707 28 999|2603,56 2602,57 2597,54 2601,52 2601,57 2600,57 2596,54 2601,53 2601,56 2602,57 2597,54 2613,52 |2526|234 "
2Oct 2, 2026 07:450376,409,999366,359,0001,023,0002,113,536expected "53696515662632000 ", got "2712 27 999|2601,55 2604,56 2596,53 2604,51 2599,54 2602,55 2596,53 2602,51 2601,55 2602,55 2600,53 2603,51 |2530|232 "
3Oct 2, 2026 07:450377,049,999366,981,0001,011,0002,113,536expected "53684908900213328 ", got "2717 26 999|2607,56 2607,58 2602,55 2603,53 2607,57 2607,58 2602,54 2605,52 2609,57 2608,58 2602,54 2603,53 |2533|158 "