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 29, 2023 21:13Franek KortaFranek KortaScore: 63,162Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 29, 2023 21:1362,91445,986,07622,266,0001,012,0002,269,184
2Aug 29, 2023 21:1362,92748,664,30422,271,0001,012,0002,445,312
3Aug 29, 2023 21:1362,93047,545,01522,272,0001,012,0002,433,024
4Aug 29, 2023 21:1362,94144,607,85422,276,0001,012,0002,527,232
5Aug 29, 2023 21:1362,94641,783,61223,290,00002,269,184
6Aug 29, 2023 21:1363,08144,601,86722,326,0001,014,0002,531,328
7Aug 29, 2023 21:1363,16251,903,95421,338,0002,032,0002,269,184
8Aug 29, 2023 21:1363,28441,525,89322,397,0001,018,0002,441,216
9Aug 29, 2023 21:1363,32245,074,87819,355,0004,074,0002,531,328
10Aug 29, 2023 21:1367,32891,730,14624,911,32702,211,840
11Aug 29, 2023 21:1367,53586,096,46524,988,05802,293,760
12Aug 29, 2023 21:1368,07590,587,37525,187,66702,170,880