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 07:44Karthik 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 07:440379,403,595367,587,0001,212,0002,113,536expected "53687055682723662 ", got "2711 27 999|2612,61 2621,75 2616,67 2608,61 2607,60 2619,73 2615,68 2609,61 2606,61 2618,73 2613,68 2607,61 |2530|156 "
2Oct 2, 2026 07:440377,279,235367,154,0001,020,0002,113,536expected "53685298671286027 ", got "2716 27 999|2603,58 2615,72 2608,64 2602,58 2601,58 2613,71 2608,64 2604,58 2601,57 2615,71 2608,64 2602,58 |2534|34 "
3Oct 2, 2026 07:440377,035,373366,766,0001,075,0002,113,536expected "53679508931618986 ", got "2710 27 999|2602,58 2611,71 2605,64 2598,57 2599,57 2611,71 2606,64 2600,57 2600,58 2629,71 2606,65 2599,58 |2527|19 "