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 16, 2023 16:22Paul MasurelPaul MasurelScore: 73,872Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 16, 2023 16:2273,67996,138,46927,261,10502,273,280
2Jul 16, 2023 16:2273,87296,614,66627,332,60002,199,552
3Jul 16, 2023 16:2274,310101,776,86027,494,67802,256,896