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 14:47Karthik 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 14:470560,404,322550,146,0001,002,0002,113,536expected "53690157377023744 ", got "2586 2477 3914 4098 4882 4888 4581 2579 2478 3954 4097 4899 4883 4581 68 "
2Oct 2, 2026 14:470560,500,276550,285,0001,121,0002,113,536expected "53688633258866637 ", got "2590 2490 3940 4104 4887 4889 4580 2570 2490 3911 4096 4887 4887 4581 224 "
3Oct 2, 2026 14:470560,893,163550,691,0001,140,0002,113,536expected "53688821470651046 ", got "2610 2493 3920 4107 4903 4886 4582 2578 2494 3910 4100 4887 4894 4581 148 "