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 28, 2023 21:13Franek KortaFranek KortaScore: 76,092Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 28, 2023 21:1375,30357,031,30326,867,000995,0002,441,216
2Aug 28, 2023 21:1375,35153,125,02626,885,000995,0002,437,120
3Aug 28, 2023 21:1375,40353,413,24126,903,000996,0002,531,328
4Aug 28, 2023 21:1375,67849,073,82625,001,0003,000,0002,531,328
5Aug 28, 2023 21:1375,73854,623,02425,021,0003,002,0002,441,216
6Aug 28, 2023 21:1375,90552,122,28726,079,0002,006,0002,441,216
7Aug 28, 2023 21:1376,09249,806,74027,149,0001,005,0002,441,216
8Aug 28, 2023 21:1376,14350,424,70827,167,0001,006,0002,531,328
9Aug 28, 2023 21:1376,312100,892,65228,235,48502,170,880
10Aug 28, 2023 21:1376,35747,804,25127,243,0001,009,0002,531,328
11Aug 28, 2023 21:1376,726107,682,77428,388,54502,289,664
12Aug 28, 2023 21:1377,122102,004,13328,535,05702,281,472