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:14Tejas G.Tejas G.Score: 7,931Success
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:147,86288,100,99363,246,0002,007,0002,285,568
2Nov 4, 2025 04:147,87089,663,36063,315,0002,010,0002,269,184
3Nov 4, 2025 04:147,87388,642,06564,341,0001,005,0002,519,040
4Nov 4, 2025 04:147,87792,993,98264,372,0001,005,0002,285,568
5Nov 4, 2025 04:147,88289,344,94764,416,0001,006,0002,285,568
6Nov 4, 2025 04:147,91592,242,57564,681,0001,010,0002,285,568
7Nov 4, 2025 04:147,93193,068,30165,825,00002,277,376
8Nov 4, 2025 04:147,93789,940,85363,880,0001,996,0002,285,568
9Nov 4, 2025 04:147,96792,024,33263,123,0003,005,0002,285,568
10Nov 4, 2025 04:148,02290,183,54766,582,00002,269,184
11Nov 4, 2025 04:148,08290,459,30565,081,0002,002,0002,260,992
12Nov 4, 2025 04:148,11895,882,25066,372,0001,005,0002,277,376