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: 384,508Success
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:47384,132168,825,110140,128,0002,001,0002,269,184
2Nov 23, 2024 16:47384,246168,354,222141,170,0001,001,0002,289,664
3Nov 23, 2024 16:47384,257173,819,854140,173,0002,002,0002,269,184
4Nov 23, 2024 16:47384,278168,661,994140,181,0002,002,0002,523,136
5Nov 23, 2024 16:47384,508169,844,122141,267,0001,001,0002,289,664
6Nov 23, 2024 16:47384,514169,350,116140,267,0002,003,0002,289,664
7Nov 23, 2024 16:47384,608169,980,689141,303,0001,002,0002,289,664
8Nov 23, 2024 16:47384,676163,748,270140,326,0002,004,0002,265,088
9Nov 23, 2024 16:47384,959167,552,863141,432,0001,003,0002,281,472