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 22:13Yuriy LyfenkoYuriy LyfenkoScore: 67,500Success
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 22:1367,335586,911,03924,913,76502,244,608
2Jul 8, 2021 22:1367,500584,770,58924,975,00402,256,896
3Jul 8, 2021 22:1369,237584,589,82525,617,71002,248,704