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 listAug 11, 2025 02:01RyhbtRyhbtScore: 58,187Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 11, 2025 02:0154,347478,581,608449,081,0002,000,0002,506,752
2Aug 11, 2025 02:0158,120507,267,793482,397,00002,277,376
3Aug 11, 2025 02:0158,183505,800,869479,920,0002,999,0002,506,752
4Aug 11, 2025 02:0158,184509,592,953481,930,000999,0002,506,752
5Aug 11, 2025 02:0158,187508,519,378481,956,000999,0002,506,752
6Aug 11, 2025 02:0158,740517,488,056484,543,0002,997,0002,289,664
7Aug 11, 2025 02:0158,861514,354,948486,552,0001,998,0002,514,944
8Aug 11, 2025 02:0158,870516,633,398485,622,0002,997,0002,281,472
9Aug 11, 2025 02:0158,873513,979,950485,651,0002,997,0002,502,656