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:27Karthik 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:270324,743,605314,557,0001,172,0002,113,536expected "53681499620226795 ", got "2718 28 999|2606,54 2606,54 2607,54 2607,54 2616,54 2618,54 2608,54 2607,54 2601,53 2602,54 |2530|59 "
2Oct 2, 2026 06:270325,812,454315,650,0001,136,0002,113,536expected "53691222542237836 ", got "2719 26 999|2613,55 2611,55 2619,56 2625,56 2628,56 2628,56 2616,57 2616,56 2612,57 2611,56 |2533|89 "
3Oct 2, 2026 06:270325,973,751314,650,0002,009,0002,113,536expected "53683131716393709 ", got "2707 26 999|2599,53 2597,51 2796,57 2602,52 2611,53 2610,52 2602,53 2600,53 2598,53 2598,52 |2527|222 "