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 31, 2024 21:56Yuriy LyfenkoYuriy LyfenkoScore: 59,846Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 31, 2024 21:5659,570543,759,77520,038,0002,003,0002,527,232
2Aug 31, 2024 21:5659,600546,525,04920,048,0002,004,0002,531,328
3Aug 31, 2024 21:5659,649545,877,99220,064,0002,006,0002,445,312
4Aug 31, 2024 21:5659,673542,359,23920,072,0002,007,0002,531,328
5Aug 31, 2024 21:5659,746550,342,44120,097,0002,009,0002,531,328
6Aug 31, 2024 21:5659,776548,144,74720,107,0002,010,0002,527,232
7Aug 31, 2024 21:5659,846541,386,14420,130,0002,013,0002,527,232
8Aug 31, 2024 21:5659,868544,921,90020,138,0002,013,0002,269,184
9Aug 31, 2024 21:5659,892549,482,85920,146,0002,014,0002,269,184
10Aug 31, 2024 21:5659,927546,031,27021,166,0001,007,0002,535,424
11Aug 31, 2024 21:5659,970544,119,42220,172,0002,017,0002,531,328
12Aug 31, 2024 21:5660,173545,330,34321,252,0001,012,0002,531,328