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 3, 2023 21:26Yurkov AlekseyYurkov AlekseyScore: 105,105Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 3, 2023 21:2698,818105,493,20136,562,81202,265,088
2Apr 3, 2023 21:2699,26099,369,35136,726,13002,269,184
3Apr 3, 2023 21:26100,218108,178,26537,080,75402,273,280
4Apr 3, 2023 21:26104,58672,619,47737,679,0001,018,0002,273,280
5Apr 3, 2023 21:26104,59569,966,47437,682,0001,018,0002,289,664
6Apr 3, 2023 21:26105,06275,296,35237,877,000996,0002,289,664
7Apr 3, 2023 21:26105,10563,338,14136,895,0001,994,0002,273,280
8Apr 3, 2023 21:26105,34359,211,36437,978,000999,0002,273,280
9Apr 3, 2023 21:26105,42763,072,25437,008,0002,000,0002,289,664
10Apr 3, 2023 21:26105,63260,196,30337,080,0002,004,0002,289,664
11Apr 3, 2023 21:26106,06261,746,86237,231,0002,012,0002,387,968
12Apr 3, 2023 21:26107,23070,144,04738,658,0001,017,0002,289,664