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:33AnSaAnSaScore: 118,792Success
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:33118,41162,292,90241,775,0002,037,0002,277,376
2Jan 29, 2024 13:33118,46269,020,94941,839,0001,992,0002,273,280
3Jan 29, 2024 13:33118,50571,277,05341,854,0001,993,0002,379,776
4Jan 29, 2024 13:33118,57371,706,90441,878,0001,994,0002,265,088
5Jan 29, 2024 13:33118,57368,853,99642,852,0001,020,0002,277,376
6Jan 29, 2024 13:33118,67370,289,51042,912,000997,0002,277,376
7Jan 29, 2024 13:33118,79266,680,49241,956,0001,997,0002,265,088
8Jan 29, 2024 13:33118,88966,728,76242,990,000999,0002,531,328
9Jan 29, 2024 13:33119,28467,669,95841,126,0003,009,0002,277,376
10Jan 29, 2024 13:33121,173119,500,60444,834,12502,179,072
11Jan 29, 2024 13:33121,218106,838,83544,850,77902,269,184
12Jan 29, 2024 13:33125,264102,845,47546,347,58802,281,472