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 14:40Yuriy LyfenkoYuriy LyfenkoScore: 142,835Success
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 14:40142,582120,047,68952,755,18502,187,264
2Jul 13, 2021 14:40142,835103,432,24952,848,90102,187,264
3Jul 13, 2021 14:40142,897129,732,29952,872,01502,187,264