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:08Andrey TsvetkovAndrey TsvetkovScore: 260,866Success
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:08260,631154,601,66596,433,56002,252,800
2Jul 12, 2021 18:08260,866156,580,85496,520,55302,195,456
3Jul 12, 2021 18:08260,945159,725,68196,549,51202,207,744