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 30, 2024 09:54woodsy-sounding-wilful-sapwoodwoodsy-sounding-wilful-sapwoodScore: 839,622Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 30, 2024 09:54795,276367,223,730294,252,27302,228,224
2Mar 30, 2024 09:54839,622390,589,424310,660,12702,220,032
3Mar 30, 2024 09:541,013,716434,734,168375,075,06602,232,320