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 listFeb 18, 2026 02:01Adam LaRussoAdam LaRussoScore: 64,171Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 18, 2026 02:0164,114556,926,821529,150,0003,000,0002,277,376
2Feb 18, 2026 02:0164,161558,662,332530,537,0001,998,0002,277,376
3Feb 18, 2026 02:0164,166560,485,776531,577,000999,0002,277,376
4Feb 18, 2026 02:0164,169563,139,581531,600,000999,0002,277,376
5Feb 18, 2026 02:0164,171558,214,150528,626,0003,997,0002,514,944
6Feb 18, 2026 02:0164,174557,905,675531,645,000999,0002,265,088
7Feb 18, 2026 02:0164,176556,677,026530,662,0001,998,0002,277,376
8Feb 18, 2026 02:0164,187555,645,915530,756,0001,999,0002,269,184
9Feb 18, 2026 02:0164,189555,772,046531,769,000999,0002,277,376