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 listApr 9, 2023 16:24Franek KortaFranek KortaScore: 77,962Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 9, 2023 16:2475,28454,286,63125,866,0001,989,0002,449,408
2Apr 9, 2023 16:2475,89551,001,26226,076,0002,005,0002,437,120
3Apr 9, 2023 16:2477,14354,798,01728,543,00002,531,328
4Apr 9, 2023 16:2477,14651,417,43127,525,0001,019,0002,265,088
5Apr 9, 2023 16:2477,28452,120,12126,553,0002,042,0002,445,312
6Apr 9, 2023 16:2477,57657,874,41727,678,0001,025,0002,531,328
7Apr 9, 2023 16:2477,96255,179,44526,857,0001,989,0002,437,120
8Apr 9, 2023 16:2477,99551,543,95926,868,0001,990,0002,527,232
9Apr 9, 2023 16:2477,99757,227,06625,874,0002,985,0002,265,088
10Apr 9, 2023 16:2480,10997,316,67629,640,32602,293,760
11Apr 9, 2023 16:2480,92589,326,43229,942,28902,289,664
12Apr 9, 2023 16:2481,52889,434,47230,165,32402,293,760