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 listJan 10, 2026 11:06Alexander FrolovAlexander FrolovScore: 46,700Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 10, 2026 11:0646,664417,637,129386,308,0001,000,0002,277,376
2Jan 10, 2026 11:0646,677413,202,022386,418,0001,001,0002,277,376
3Jan 10, 2026 11:0646,678415,595,645386,428,0001,001,0002,490,368
4Jan 10, 2026 11:0646,695413,282,901385,569,0001,997,0002,486,272
5Jan 10, 2026 11:0646,700417,432,393385,614,0001,998,0002,277,376
6Jan 10, 2026 11:0646,702420,607,351386,628,000999,0002,478,080
7Jan 10, 2026 11:0647,044422,646,384389,463,0001,001,0002,490,368
8Jan 10, 2026 11:0647,065415,027,739388,644,0001,998,0002,277,376
9Jan 10, 2026 11:0647,067416,207,029388,660,0001,998,0002,277,376