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 7, 2021 23:32Yuriy LyfenkoYuriy LyfenkoScore: 2,125,273Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2021 23:322,115,0381,766,488,040782,564,202059,666,432
2Jul 7, 2021 23:322,125,2731,909,840,906786,351,076063,516,672
3Jul 7, 2021 23:322,137,2141,781,117,748790,769,224062,607,360