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 28, 2024 17:50Joad NacerJoad NacerScore: 59,776Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 28, 2024 17:5059,53044,329,95721,025,0001,001,0002,433,024
2Nov 28, 2024 17:5059,57843,753,72320,040,0002,004,0002,531,328
3Nov 28, 2024 17:5059,58444,503,84221,044,0001,002,0002,433,024
4Nov 28, 2024 17:5059,65145,076,68521,068,0001,003,0002,531,328
5Nov 28, 2024 17:5059,77647,024,86421,112,0001,005,0002,269,184
6Nov 28, 2024 17:5059,80544,172,97020,117,0002,011,0002,428,928
7Nov 28, 2024 17:5059,82248,957,16721,128,0001,006,0002,531,328
8Nov 28, 2024 17:5059,87657,319,39121,147,0001,007,0002,433,024
9Nov 28, 2024 17:5059,87842,160,25221,148,0001,007,0002,531,328