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 23, 2024 16:47E SequeiraE SequeiraScore: 21,040,854Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 23, 2024 16:4721,036,4467,820,239,4507,581,680,000201,805,0002,301,952
2Nov 23, 2024 16:4721,040,8547,820,295,5157,580,271,000204,845,0002,281,472
3Nov 23, 2024 16:4721,078,9867,835,592,0307,596,402,000202,823,0002,306,048