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 16:12Franek KortaFranek KortaScore: 100,862Success
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 16:1297,53859,608,93235,087,0001,002,0002,269,184
2Apr 9, 2023 16:1297,54663,177,27135,090,0001,002,0002,527,232
3Apr 9, 2023 16:1298,17862,983,61035,317,0001,009,0002,445,312
4Apr 9, 2023 16:1298,84960,992,83136,574,00002,527,232
5Apr 9, 2023 16:1299,61163,728,69835,860,000996,0002,527,232
6Apr 9, 2023 16:1299,75156,137,19334,913,0001,995,0002,527,232
7Apr 9, 2023 16:12100,86264,324,74737,319,00002,531,328
8Apr 9, 2023 16:12101,03259,101,90035,362,0002,020,0002,527,232
9Apr 9, 2023 16:12101,50362,846,92637,556,00002,441,216
10Apr 9, 2023 16:12102,286117,207,81937,845,98702,297,856
11Apr 9, 2023 16:12105,317124,727,11938,967,44202,293,760
12Apr 9, 2023 16:12106,016110,565,60239,225,76602,297,856