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 13, 2024 06:37Alexander KosachevAlexander KosachevScore: 53,979Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 13, 2024 06:3753,956471,034,742444,834,0002,998,0002,482,176
2Nov 13, 2024 06:3753,971476,210,349446,963,000999,0002,531,328
3Nov 13, 2024 06:3753,973473,481,690445,980,0001,999,0002,527,232
4Nov 13, 2024 06:3753,975475,306,598445,991,0001,999,0002,478,080
5Nov 13, 2024 06:3753,979477,268,512447,022,0001,000,0002,482,176
6Nov 13, 2024 06:3753,992469,714,075448,133,00002,486,272
7Nov 13, 2024 06:3754,004471,057,554448,234,00002,531,328
8Nov 13, 2024 06:3754,027470,861,328448,426,00002,527,232
9Nov 13, 2024 06:3754,033473,464,590447,479,000998,0002,531,328