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 6, 2022 20:15Franek KortaFranek KortaScore: 74,454Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 6, 2022 20:1573,89552,079,13025,316,0002,025,0002,527,232
2Aug 6, 2022 20:1574,01649,809,65925,358,0002,028,0002,531,328
3Aug 6, 2022 20:1574,06551,476,27527,404,00002,523,136
4Aug 6, 2022 20:1574,08656,220,24027,412,00002,281,472
5Aug 6, 2022 20:1574,30350,465,04826,474,0001,018,0002,269,184
6Aug 6, 2022 20:1574,40054,527,13426,509,0001,019,0002,281,472
7Aug 6, 2022 20:1574,45452,985,92226,528,0001,020,0002,281,472
8Aug 6, 2022 20:1574,64359,864,50726,596,0001,022,0002,281,472
9Aug 6, 2022 20:1574,71457,404,75125,597,0002,047,0002,281,472
10Aug 6, 2022 20:1578,224110,192,67728,942,90502,260,992
11Aug 6, 2022 20:1578,24695,865,61328,950,98802,256,896
12Aug 6, 2022 20:1578,56387,352,69929,068,25002,256,896