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 05:40Karthik 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 05:400381,557,872371,383,0001,122,0002,113,536expected "53682252995352029 ", got "2717 28 999|2622,54 2618,53 2682,53 2685,53 2621,53 2618,53 2681,52 2647,53 2619,53 2616,54 2680,53 2649,53 |2534|119 "
2Oct 2, 2026 05:400380,254,259369,965,0001,191,0002,113,536expected "53679832237329994 ", got "2708 26 999|2611,54 2610,54 2676,53 2641,53 2611,54 2611,55 2675,53 2642,53 2611,54 2609,54 2688,54 2640,53 |2527|5 "
3Oct 2, 2026 05:400381,270,654371,187,0001,012,0002,113,536expected "53687924848455629 ", got "2714 27 999|2621,52 2618,53 2678,52 2664,51 2626,52 2619,52 2678,52 2645,51 2621,52 2618,52 2678,51 2647,51 |2534|17 "