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 29, 2023 21:21Franek KortaFranek KortaScore: 63,324Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 29, 2023 21:2162,97043,492,83423,299,00002,445,312
2Aug 29, 2023 21:2163,00346,364,33723,311,00002,269,184
3Aug 29, 2023 21:2163,10052,182,52321,317,0002,030,0002,269,184
4Aug 29, 2023 21:2163,17846,163,00322,360,0001,016,0002,269,184
5Aug 29, 2023 21:2163,18145,357,37522,361,0001,016,0002,531,328
6Aug 29, 2023 21:2163,23048,137,76422,378,0001,017,0002,437,120
7Aug 29, 2023 21:2163,32444,656,14823,430,00002,441,216
8Aug 29, 2023 21:2163,39546,458,41423,456,00002,445,312
9Aug 29, 2023 21:2163,49545,661,97923,493,00002,269,184
10Aug 29, 2023 21:2167,22895,087,69924,874,47202,220,032
11Aug 29, 2023 21:2167,45188,787,79424,956,78202,187,264
12Aug 29, 2023 21:2167,68587,132,85125,043,55902,297,856