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 25, 2023 18:10Yurkov AlekseyYurkov AlekseyScore: 145,947Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 25, 2023 18:10145,688111,006,90253,904,41302,269,184
2Mar 25, 2023 18:10145,947130,664,10554,000,25202,269,184
3Mar 25, 2023 18:10146,698112,137,88754,278,19702,273,280