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 listNov 29, 2024 19:12E SequeiraE SequeiraScore: 237,743Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 29, 2024 19:12237,689116,047,35385,947,0001,998,0002,273,280
2Nov 29, 2024 19:12237,743118,816,08586,966,000999,0002,285,568
3Nov 29, 2024 19:12242,930115,371,77587,887,0001,997,0002,265,088