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 13, 2021 18:53Yuriy LyfenkoYuriy LyfenkoScore: 65,457Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 13, 2021 18:5365,179583,902,07724,116,21602,244,608
2Jul 13, 2021 18:5365,457584,264,58224,219,14802,244,608
3Jul 13, 2021 18:5365,579585,156,10024,264,31202,244,608