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 30, 2022 20:37PhibPhibScore: 2,125,121Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 30, 2022 20:371,985,300794,970,413734,561,14802,301,952
2Sep 30, 2022 20:372,125,121840,702,812786,294,68502,211,840
3Sep 30, 2022 20:372,312,366918,226,175855,575,59402,310,144