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:48Franek KortaFranek KortaScore: 72,811Success
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:4869,86254,338,09724,855,000994,0002,433,024
2Apr 9, 2023 16:4870,54147,616,06825,097,0001,003,0002,437,120
3Apr 9, 2023 16:4871,14648,026,10925,312,0001,012,0002,269,184
4Apr 9, 2023 16:4871,76245,128,66326,552,00002,445,312
5Apr 9, 2023 16:4872,55451,902,67224,857,0001,988,0002,433,024
6Apr 9, 2023 16:4872,61951,025,93024,879,0001,990,0002,441,216
7Apr 9, 2023 16:4872,81152,224,75224,945,0001,995,0002,531,328
8Apr 9, 2023 16:4873,75749,938,25524,258,0003,032,0002,531,328
9Apr 9, 2023 16:4876,64352,940,63327,346,0001,012,0002,531,328
10Apr 9, 2023 16:4880,03388,517,27129,612,04302,174,976
11Apr 9, 2023 16:4880,89491,052,25929,930,83202,289,664
12Apr 9, 2023 16:4881,33285,847,06830,092,97402,179,072