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, 2023 23:10Andrew EpsteinAndrew EpsteinScore: 21,335,690Success
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, 2023 23:1021,277,9777,927,989,9867,872,851,44602,289,664
2Jul 8, 2023 23:1021,335,6907,953,400,6487,894,205,24002,285,568
3Jul 8, 2023 23:1021,420,5067,987,741,7167,925,587,06202,285,568