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 listMar 31, 2023 18:02Franek KortaFranek KortaScore: 71,827Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 31, 2023 18:0271,51653,829,37625,444,0001,017,0002,269,184
2Mar 31, 2023 18:0271,54150,525,31026,470,00002,527,232
3Mar 31, 2023 18:0271,69250,199,83126,526,00002,445,312
4Mar 31, 2023 18:0271,70048,373,16526,529,00002,441,216
5Mar 31, 2023 18:0271,72747,429,48926,539,00002,445,312
6Mar 31, 2023 18:0271,80849,040,23626,569,00002,269,184
7Mar 31, 2023 18:0271,82753,983,80924,532,0002,044,0002,531,328
8Mar 31, 2023 18:0271,83046,325,47426,577,00002,269,184
9Mar 31, 2023 18:0271,91650,535,84024,563,0002,046,0002,531,328
10Mar 31, 2023 18:0275,871100,367,38828,072,25302,289,664
11Mar 31, 2023 18:0276,045105,989,30128,136,70402,289,664
12Mar 31, 2023 18:0276,33380,314,42928,243,18802,170,880