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 15, 2024 01:45zielajzielajError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 15, 2024 01:4400000Error: Killed by timeoutstderr
2Nov 15, 2024 01:453,68155,906,62330,550,00002,445,312
3Nov 15, 2024 01:453,68255,561,77230,563,00002,351,104
4Nov 15, 2024 01:453,68757,132,43529,586,0001,020,0002,347,008
5Nov 15, 2024 01:453,69260,354,69630,643,00002,523,136
6Nov 15, 2024 01:453,69759,559,82929,661,0001,022,0002,527,232
7Nov 15, 2024 01:453,69767,427,35529,661,0001,022,0002,351,104
8Nov 15, 2024 01:453,71555,412,44830,837,00002,355,200
9Nov 15, 2024 01:453,71557,300,23229,840,000994,0002,342,912
10Nov 15, 2024 01:453,71657,343,51928,852,0001,989,0002,342,912
11Nov 15, 2024 01:453,80558,222,68231,580,00002,277,376
12Nov 15, 2024 01:453,81454,695,26331,660,00002,367,488
13Nov 15, 2024 01:453,83962,518,88331,863,00002,355,200