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 14:11AnSaAnSaScore: 152,868Success
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 14:11113,757105,977,25342,090,14002,269,184
2Jan 29, 2024 14:11113,882110,040,06542,136,20802,256,896
3Jan 29, 2024 14:11114,674110,191,27642,429,26002,260,992
4Jan 29, 2024 14:11152,68484,528,41343,379,00013,114,0002,273,280
5Jan 29, 2024 14:11152,71978,321,32942,380,00014,126,0002,265,088
6Jan 29, 2024 14:11152,84983,182,86638,376,00018,178,0002,400,256
7Jan 29, 2024 14:11152,86887,435,10545,451,00011,110,0002,334,720
8Jan 29, 2024 14:11153,06283,633,07644,498,00012,135,0002,334,720
9Jan 29, 2024 14:11153,70579,852,92943,901,00012,970,0002,265,088
10Jan 29, 2024 14:11153,79584,185,34942,928,00013,976,0002,347,008
11Jan 29, 2024 14:11153,86280,046,27544,944,00011,985,0002,318,336
12Jan 29, 2024 14:11154,68187,226,70339,159,00018,073,0002,396,160