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 listDec 27, 2023 10:30Oleg KovalovOleg KovalovScore: 21,279,848Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 27, 2023 10:3021,238,9977,917,802,5617,858,429,04102,297,856
2Dec 27, 2023 10:3021,279,8487,944,553,8067,873,543,85402,289,664
3Dec 27, 2023 10:3021,312,3007,961,314,8327,885,551,06502,281,472