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:30Karthik 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:320380,429,871370,175,0001,034,0002,113,536expected "53684771216743418 ", got "2706 28 999|2596,54 2595,54 2626,54 2628,55 2668,54 2669,54 2602,54 2597,54 2726,54 2723,53 2606,54 2594,53 |2528|143 "
2Oct 2, 2026 06:320381,455,169371,260,0001,100,0002,113,536expected "53686573787901274 ", got "2718 28 999|2602,54 2622,55 2633,54 2637,54 2676,54 2677,54 2600,53 2609,53 2734,53 2729,53 2602,53 2602,53 |2535|86 "
3Oct 2, 2026 06:320380,665,430370,601,0001,019,0002,113,536expected "53686498460393139 ", got "2712 27 999|2603,53 2599,52 2631,53 2640,54 2673,53 2676,53 2597,52 2597,52 2724,51 2724,51 2597,52 2597,52 |2533|87 "