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:43Karthik 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:440817,605,813807,498,0001,077,0002,113,536expected "53696527152334382 ", got "s274 2487 A2458/2458 B2675/2676 C2684/2688 D3082/3083 E3186/3187 F2723/2745 G2673/2673 "
2Oct 2, 2026 06:440816,150,956805,710,0001,146,0002,113,536expected "53696586724138162 ", got "s269 2474 A2457/2458 B2669/2671 C2672/2682 D3077/3078 E3187/3191 F2724/2725 G2666/2670 "
3Oct 2, 2026 06:440820,288,218810,091,0001,106,0002,113,536expected "53677606574714185 ", got "s269 2484 A2464/2465 B2689/2689 C2698/2699 D3092/3094 E3199/3201 F2742/2751 G2681/2681 "