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 listFeb 21, 2024 15:31Huy Duc LeHuy Duc LeScore: 21,336,346Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 21, 2024 15:3121,233,9937,918,316,0987,856,577,47502,285,568
2Feb 21, 2024 15:3121,336,3467,959,890,9667,894,447,97002,285,568
3Feb 21, 2024 15:3121,360,8737,961,269,0017,903,523,17202,289,664