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 14, 2026 15:34Juraj ZelmanJuraj ZelmanScore: 15,771Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 14, 2026 15:3415,753155,543,480129,748,000998,0002,289,664
2Feb 14, 2026 15:3415,761158,751,253128,819,0001,997,0002,363,392
3Feb 14, 2026 15:3415,762165,422,875129,828,000998,0002,363,392
4Feb 14, 2026 15:3415,768156,959,453129,873,000999,0002,293,760
5Feb 14, 2026 15:3415,771163,720,937129,903,000999,0002,367,488
6Feb 14, 2026 15:3415,771156,958,052129,904,000999,0002,293,760
7Feb 14, 2026 15:3415,776158,715,731128,942,0001,999,0002,359,296
8Feb 14, 2026 15:3415,778158,989,817128,955,0001,999,0002,367,488
9Feb 14, 2026 15:3415,780164,353,666128,971,0001,999,0002,293,760