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 18:54E SequeiraE SequeiraScore: 155,392Success
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 18:54154,90879,750,45755,305,0002,011,0002,318,336
2Nov 29, 2024 18:54155,19584,103,75057,422,00002,314,240
3Nov 29, 2024 18:54155,38480,320,45857,492,00002,457,600
4Nov 29, 2024 18:54155,38683,783,89655,476,0002,017,0002,453,504
5Nov 29, 2024 18:54155,39275,014,83256,487,0001,008,0002,322,432
6Nov 29, 2024 18:54155,49781,883,32456,525,0001,009,0002,465,792
7Nov 29, 2024 18:54155,64685,935,81657,589,00002,445,312
8Nov 29, 2024 18:54155,87683,862,08557,674,00002,322,432
9Nov 29, 2024 18:54156,30386,294,64955,838,0001,994,0002,326,528