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 8, 2021 02:08Yuriy LyfenkoYuriy LyfenkoScore: 143,773Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 8, 2021 02:08140,0041,054,884,51951,801,556059,269,120
2Jul 8, 2021 02:08143,7731,033,093,23553,195,842058,867,712
3Jul 8, 2021 02:08155,4911,156,794,69257,531,805061,624,320