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 21:22Franek KortaFranek KortaScore: 99,481Success
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 21:2299,297102,099,94136,739,82902,277,376
2Apr 9, 2023 21:2299,481102,256,31136,808,06602,289,664
3Apr 9, 2023 21:22100,415101,076,69937,153,56202,293,760