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 listAug 28, 2023 21:00Franek KortaFranek KortaScore: 77,020Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 28, 2023 21:0076,901101,730,10528,453,48102,293,760
2Aug 28, 2023 21:0077,02086,875,06628,497,57902,277,376
3Aug 28, 2023 21:0077,719100,633,76428,756,00902,285,568