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:41Karthik 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:410325,385,326315,231,0001,122,0002,113,536expected "53687082448821789 ", got "2736 27 999|2646,54 2613,54 2610,54 2612,53 2603,53 2601,53 2610,54 2608,54 2607,55 2606,55 |2535|86 "
2Oct 2, 2026 06:410324,026,420313,770,0001,184,0002,113,536expected "53680715103931532 ", got "2728 26 999|2615,53 2594,53 2604,53 2599,52 2595,53 2594,52 2597,53 2610,56 2595,53 2595,53 |2527|141 "
3Oct 2, 2026 06:410324,168,213314,023,0001,112,0002,113,536expected "53690311465784274 ", got "2710 26 999|2601,53 2603,53 2604,53 2604,53 2603,53 2604,54 2605,53 2602,52 2600,53 2598,53 |2530|17 "