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 listSep 28, 2023 15:10apuxbtapuxbtScore: 179,482Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 28, 2023 15:10176,859127,653,37865,437,91302,269,184
2Sep 28, 2023 15:10179,482141,157,71566,408,52402,273,280
3Sep 28, 2023 15:10180,219138,159,73066,680,98502,269,184