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 listJul 12, 2021 04:56Andrey TsvetkovAndrey TsvetkovScore: 6,609,243Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 12, 2021 04:566,608,2752,499,034,2782,445,061,57802,203,648
2Jul 12, 2021 04:566,609,2432,515,141,5122,445,419,84002,203,648
3Jul 12, 2021 04:566,609,9702,506,171,8972,445,688,85202,207,744