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 19:42Yuriy LyfenkoYuriy LyfenkoScore: 138,315Success
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 19:42138,271117,149,01351,160,25302,191,360
2Jul 8, 2021 19:42138,315115,410,01451,176,51902,195,456
3Jul 8, 2021 19:42138,682123,715,96551,312,39702,179,072