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 17:23Igor VolkovIgor VolkovScore: 5,907,033Success
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 17:235,906,9612,240,549,5322,185,575,55102,260,992
2Aug 15, 2021 17:235,907,0332,242,778,3942,185,602,28202,260,992
3Aug 15, 2021 17:235,907,2242,245,314,7962,185,672,79102,256,896