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 listJan 29, 2024 13:20AnSaAnSaScore: 107,797Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 29, 2024 13:20106,74367,711,69236,457,0003,038,0002,281,472
2Jan 29, 2024 13:20107,13264,569,69839,639,00002,523,136
3Jan 29, 2024 13:20107,61466,136,85138,822,000995,0002,519,040
4Jan 29, 2024 13:20107,68666,901,70535,860,0003,984,0002,277,376
5Jan 29, 2024 13:20107,72762,164,34138,837,0001,022,0002,269,184
6Jan 29, 2024 13:20107,78464,298,92437,835,0002,045,0002,527,232
7Jan 29, 2024 13:20107,79767,124,85637,891,0001,994,0002,523,136
8Jan 29, 2024 13:20108,39267,706,52537,098,0003,007,0002,277,376
9Jan 29, 2024 13:20108,63862,632,18339,192,0001,004,0002,265,088
10Jan 29, 2024 13:20109,693115,526,71140,586,34402,269,184
11Jan 29, 2024 13:20109,908123,977,05040,666,11702,199,552
12Jan 29, 2024 13:20110,916104,320,55941,038,98502,269,184