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 listAug 4, 2023 16:51gchebanovgchebanovScore: 77,334Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 4, 2023 16:5176,97895,290,12028,482,04302,244,608
2Aug 4, 2023 16:5177,334105,813,05128,613,69302,256,896
3Aug 4, 2023 16:5178,58883,689,76729,077,43102,252,800