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 1, 2026 09:32Karthik ReddyKarthik ReddyScore: 3,361Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 1, 2026 09:323,34936,772,22827,803,000020,480
2Oct 1, 2026 09:323,35436,815,15427,840,000020,480
3Oct 1, 2026 09:323,35636,808,58427,857,000020,480
4Oct 1, 2026 09:323,36036,952,33927,892,000020,480
5Oct 1, 2026 09:323,36136,886,28127,897,000020,480
6Oct 1, 2026 09:323,37036,999,66427,976,000020,480
7Oct 1, 2026 09:323,37436,887,88528,006,000020,480
8Oct 1, 2026 09:323,37437,041,90228,009,000020,480
9Oct 1, 2026 09:323,40137,310,78328,234,000020,480