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 17:13Franek KortaFranek KortaScore: 75,314Success
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 17:1373,67047,460,13826,249,0001,009,0002,527,232
2Apr 9, 2023 17:1373,96256,101,73426,353,0001,013,0002,428,928
3Apr 9, 2023 17:1374,79255,573,86226,649,0001,024,0002,531,328
4Apr 9, 2023 17:1375,14951,215,41626,812,000993,0002,437,120
5Apr 9, 2023 17:1375,27350,887,76226,857,000994,0002,424,832
6Apr 9, 2023 17:1375,28654,784,41225,867,0001,989,0002,428,928
7Apr 9, 2023 17:1375,31451,030,97425,802,0002,064,0002,531,328
8Apr 9, 2023 17:1376,24651,762,51525,189,0003,022,0002,531,328
9Apr 9, 2023 17:1377,98654,195,39127,860,000995,0002,531,328
10Apr 9, 2023 17:1379,55384,165,91329,434,75602,289,664
11Apr 9, 2023 17:1384,40595,086,43031,229,68102,297,856
12Apr 9, 2023 17:1385,056109,026,91831,470,78902,297,856