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 listNov 2, 2025 15:48Tejas G.Tejas G.Score: 64,027Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 2, 2025 15:4863,889556,480,314530,281,00002,285,568
2Nov 2, 2025 15:4863,907560,800,491528,428,0001,997,0002,519,040
3Nov 2, 2025 15:4864,021558,436,008530,376,000998,0002,285,568
4Nov 2, 2025 15:4864,023558,201,939529,391,0001,997,0002,269,184
5Nov 2, 2025 15:4864,027557,760,389531,426,00002,277,376
6Nov 2, 2025 15:4864,034557,546,727530,480,000999,0002,285,568
7Nov 2, 2025 15:4864,045558,225,825530,574,000999,0002,269,184
8Nov 2, 2025 15:4864,080562,278,156528,865,0002,999,0002,277,376
9Nov 2, 2025 15:4864,120557,911,030531,195,0001,000,0002,510,848