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 3, 2023 22:03Franek KortaFranek KortaScore: 212,114Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 3, 2023 22:03211,136133,015,26278,120,28002,297,856
2Apr 3, 2023 22:03212,114135,954,01878,482,20502,297,856
3Apr 3, 2023 22:03214,276138,066,83479,281,95802,297,856