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 listMar 27, 2023 21:36Yurkov AlekseyYurkov AlekseyScore: 553,403Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 27, 2023 21:36549,552263,061,734203,334,34602,269,184
2Mar 27, 2023 21:36553,403259,093,990204,758,93102,273,280
3Mar 27, 2023 21:36577,205271,028,090213,565,76102,265,088