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:53Karthik 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:540389,202,816379,110,0001,117,0002,113,536expected "53684070036087555 ", got "2714 27 999|2619,56 2718,86 2720,86 2777,85 2619,56 2719,86 2720,86 2776,84 2620,56 2718,86 2722,87 2778,85 |2536|75 "
2Oct 2, 2026 05:540390,140,074379,611,0001,110,0002,113,536expected "53690782008935609 ", got "2705 27 999|2621,53 2722,87 2719,86 2792,86 2622,54 2719,86 2721,87 2793,85 2623,53 2720,86 2722,87 2792,86 |2532|142 "
3Oct 2, 2026 05:540388,280,852378,118,0001,016,0002,113,536expected "53684452351567319 ", got "2704 28 999|2611,53 2705,85 2706,86 2780,84 2626,52 2708,86 2705,86 2779,85 2608,53 2706,85 2706,85 2780,85 |2527|227 "