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 21:00E SequeiraE SequeiraScore: 155,481Success
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 21:00155,40378,267,65056,491,0001,008,0002,490,368
2Nov 29, 2024 21:00155,48180,915,83855,510,0002,018,0002,498,560
3Nov 29, 2024 21:00155,72790,951,63155,598,0002,021,0002,318,336