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 15, 2021 11:42Igor VolkovIgor VolkovScore: 335,521Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 15, 2021 11:42335,472190,564,258124,124,57502,244,608
2Aug 15, 2021 11:42335,521186,671,474124,142,66402,236,416
3Aug 15, 2021 11:42336,447184,713,296124,485,37002,256,896