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 12, 2021 18:17Andrey TsvetkovAndrey TsvetkovScore: 212,120Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 12, 2021 18:17212,099153,507,69778,476,72002,191,360
2Jul 12, 2021 18:17212,120144,276,34878,484,44302,191,360
3Jul 12, 2021 18:17212,207131,547,84078,516,55802,203,648