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 3, 2023 21:48Franek KortaFranek KortaScore: 71,870Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 3, 2023 21:4871,46249,798,77726,441,00002,437,120
2Apr 3, 2023 21:4871,61450,215,59725,478,0001,019,0002,531,328
3Apr 3, 2023 21:4871,64651,089,09626,509,00002,531,328
4Apr 3, 2023 21:4871,74148,662,71126,544,00002,445,312
5Apr 3, 2023 21:4871,78450,343,08926,560,00002,527,232
6Apr 3, 2023 21:4871,81147,772,35625,549,0001,021,0002,527,232
7Apr 3, 2023 21:4871,87051,558,89025,570,0001,022,0002,269,184
8Apr 3, 2023 21:4871,90351,885,87526,604,00002,449,408
9Apr 3, 2023 21:4871,91652,867,20326,609,00002,441,216
10Apr 3, 2023 21:4875,931104,000,86228,094,52602,297,856
11Apr 3, 2023 21:4875,97199,149,77328,109,12202,293,760
12Apr 3, 2023 21:4876,19488,416,93828,191,89202,297,856