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:10Franek KortaFranek KortaScore: 80,635Success
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:1078,45952,358,62327,028,0002,002,0002,445,312
2Apr 9, 2023 16:1079,55950,100,76429,437,00002,433,024
3Apr 9, 2023 16:1079,74355,424,01127,471,0002,034,0002,437,120
4Apr 9, 2023 16:1079,82752,225,35128,518,0001,018,0002,269,184
5Apr 9, 2023 16:1079,87654,409,27326,497,0003,057,0002,531,328
6Apr 9, 2023 16:1080,11657,208,64629,643,00002,265,088
7Apr 9, 2023 16:1080,63553,935,28228,841,000994,0002,531,328
8Apr 9, 2023 16:1081,23851,337,66829,057,0001,001,0002,441,216
9Apr 9, 2023 16:1082,08652,511,87629,360,0001,012,0002,531,328
10Apr 9, 2023 16:1088,13397,121,34932,609,11402,293,760
11Apr 9, 2023 16:1088,444104,555,27632,724,37102,297,856
12Apr 9, 2023 16:1089,33388,349,84933,053,38002,297,856