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 listJun 16, 2023 19:55Ulyanov AlekseyUlyanov AlekseyScore: 1,269,826Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 16, 2023 19:551,267,055535,358,403468,810,35002,256,896
2Jun 16, 2023 19:551,269,826551,083,159469,835,57102,265,088
3Jun 16, 2023 19:551,271,008538,233,548470,273,11702,273,280