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 listSep 20, 2023 19:29mmalczakmmalczakScore: 109,095Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 20, 2023 19:29108,40062,875,61038,103,0002,005,0002,289,664
2Sep 20, 2023 19:29108,92265,758,84738,286,0002,015,0002,289,664
3Sep 20, 2023 19:29109,04163,232,82838,328,0002,017,0002,281,472
4Sep 20, 2023 19:29109,04362,508,49638,329,0002,017,0002,289,664
5Sep 20, 2023 19:29109,07364,039,18638,340,0002,017,0002,527,232
6Sep 20, 2023 19:29109,08664,408,88638,344,0002,018,0002,269,184
7Sep 20, 2023 19:29109,09562,388,82938,347,0002,018,0002,289,664
8Sep 20, 2023 19:29109,15768,055,24538,369,0002,019,0002,527,232
9Sep 20, 2023 19:29109,47365,042,48139,493,0001,012,0002,289,664
10Sep 20, 2023 19:29110,135102,366,14840,749,79002,273,280
11Sep 20, 2023 19:29110,877111,545,61741,024,64302,260,992
12Sep 20, 2023 19:29117,767108,313,63143,573,76102,256,896