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 16, 2023 16:11mmalczakmmalczakScore: 99,446Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 16, 2023 16:1198,37658,236,06936,399,00002,273,280
2Sep 16, 2023 16:1198,47361,525,74934,411,0002,024,0002,289,664
3Sep 16, 2023 16:1198,50858,417,06235,436,0001,012,0002,273,280
4Sep 16, 2023 16:1198,51663,181,61436,451,00002,281,472
5Sep 16, 2023 16:1198,73558,849,89635,518,0001,014,0002,277,376
6Sep 16, 2023 16:1199,14961,472,83536,685,00002,289,664
7Sep 16, 2023 16:1199,44681,941,18536,795,09702,273,280
8Sep 16, 2023 16:1199,56874,003,67234,849,0001,991,0002,527,232
9Sep 16, 2023 16:1199,78462,677,95734,925,0001,995,0002,273,280
10Sep 16, 2023 16:11100,300122,822,84137,110,94402,273,280
11Sep 16, 2023 16:11100,64664,698,14434,220,0003,019,0002,277,376
12Sep 16, 2023 16:11100,85696,868,19737,316,87502,256,896