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 4, 2025 04:17Tejas G.Tejas G.Score: 7,835Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 4, 2025 04:177,80891,280,52762,812,0001,994,0002,260,992
2Nov 4, 2025 04:177,81694,242,31262,879,0001,996,0002,510,848
3Nov 4, 2025 04:177,81789,104,73463,879,000998,0002,519,040
4Nov 4, 2025 04:177,82788,459,15462,963,0001,998,0002,260,992
5Nov 4, 2025 04:177,82991,873,06062,980,0001,999,0002,285,568
6Nov 4, 2025 04:177,82989,142,20762,981,0001,999,0002,260,992
7Nov 4, 2025 04:177,83586,297,30763,029,0002,000,0002,387,968
8Nov 4, 2025 04:177,89593,218,12465,530,00002,285,568
9Nov 4, 2025 04:177,90397,595,63964,589,0001,009,0002,285,568
10Nov 4, 2025 04:177,97092,547,12364,147,0002,004,0002,265,088
11Nov 4, 2025 04:178,04894,928,82266,796,00002,260,992
12Nov 4, 2025 04:178,05190,144,97464,830,0001,994,0002,506,752