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 14, 2021 12:53Mikhail ShirokovMikhail ShirokovScore: 3,370,380Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 14, 2021 12:533,345,5631,301,601,5511,237,858,16002,289,664
2Sep 14, 2021 12:533,370,3801,320,480,0571,247,040,63002,289,664
3Sep 14, 2021 12:533,372,7381,303,838,1561,247,913,17602,297,856