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:23Karthik 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:240378,495,861368,133,0001,157,0002,113,536expected "53683344142746722 ", got "2720 28 999|2618,54 2619,54 2617,53 2620,54 2619,53 2619,54 2628,54 2627,54 2627,54 2607,55 2607,54 2608,55 |2534|246 "
2Oct 2, 2026 06:240376,945,817366,961,0001,001,0002,113,536expected "53683964205751389 ", got "2708 27 999|2607,52 2609,52 2607,52 2608,52 2611,53 2611,52 2617,53 2617,53 2614,52 2596,53 2609,53 2596,53 |2528|161 "
3Oct 2, 2026 06:240378,573,501368,451,0001,110,0002,113,536expected "53682597036371089 ", got "2719 26 999|2622,53 2622,54 2622,53 2626,55 2626,55 2624,54 2625,54 2628,54 2628,54 2608,54 2607,53 2608,53 |2531|2 "