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:49Karthik 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:490425,969,527415,732,0001,122,0002,113,536expected "53679831742145045 ", got "2709 28 999|2599,52 2598,52 3106,52 3108,52 3313,53 3314,52 3361,54 3364,54 3107,52 3106,53 2599,52 2599,52 |2531|43 "
2Oct 2, 2026 07:490427,676,013417,449,0001,151,0002,113,536expected "53685459332527606 ", got "2718 27 999|2620,54 2605,54 3123,55 3121,54 3330,54 3330,54 3378,55 3376,55 3121,55 3125,55 2603,54 2604,54 |2534|215 "
3Oct 2, 2026 07:490425,421,806415,185,0001,111,0002,113,536expected "53688446498451733 ", got "2701 26 999|2598,52 2597,52 3100,52 3099,52 3306,52 3307,52 3367,53 3354,53 3099,53 3100,52 2595,53 2596,51 |2527|61 "