TopK Sergey Svistunov

Find the sum of the 100 largest values in a stream of binary integers as fast as possible.

Input: 100 000 000 uint32 values in little-endian binary on STDIN (4 bytes each).

Output: The uint64 sum of the top 100 greatest values, printed as a decimal string.

Back to listAug 6, 2022 21:09Franek KortaFranek KortaScore: 74,216Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 6, 2022 21:0973,86255,154,14525,305,0002,024,0002,277,376
2Aug 6, 2022 21:0973,92252,229,80425,325,0002,026,0002,277,376
3Aug 6, 2022 21:0974,07053,984,74226,391,0001,015,0002,523,136
4Aug 6, 2022 21:0974,13249,520,60626,414,0001,015,0002,527,232
5Aug 6, 2022 21:0974,15756,222,96126,422,0001,016,0002,269,184
6Aug 6, 2022 21:0974,18649,806,01926,433,0001,016,0002,277,376
7Aug 6, 2022 21:0974,21652,142,14626,443,0001,017,0002,277,376
8Aug 6, 2022 21:0974,34352,669,04227,507,00002,277,376
9Aug 6, 2022 21:0974,70552,520,86225,594,0002,047,0002,277,376
10Aug 6, 2022 21:0978,15691,075,91728,917,57602,269,184
11Aug 6, 2022 21:0978,290100,866,40528,967,43602,265,088
12Aug 6, 2022 21:0978,58681,493,08129,076,71002,297,856