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 listApr 9, 2023 16:14Franek KortaFranek KortaScore: 77,524Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 9, 2023 16:1475,53252,182,48525,951,0001,996,0002,437,120
2Apr 9, 2023 16:1475,83247,056,36727,056,0001,002,0002,531,328
3Apr 9, 2023 16:1475,83250,390,86827,056,0001,002,0002,269,184
4Apr 9, 2023 16:1476,38651,240,21725,235,0003,028,0002,269,184
5Apr 9, 2023 16:1477,01651,887,91627,479,0001,017,0002,445,312
6Apr 9, 2023 16:1477,52249,912,93028,683,00002,445,312
7Apr 9, 2023 16:1477,52459,236,32328,684,00002,449,408
8Apr 9, 2023 16:1478,17350,368,77027,927,000997,0002,269,184
9Apr 9, 2023 16:1478,51959,774,20128,051,0001,001,0002,437,120
10Apr 9, 2023 16:1480,55293,683,02229,804,41502,301,952
11Apr 9, 2023 16:1481,978102,025,68530,331,83702,297,856
12Apr 9, 2023 16:1483,50996,823,97330,898,47202,277,376