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 8, 2025 08:15AnSaAnSaScore: 69,351Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 8, 2025 08:1569,01656,187,45424,515,0001,021,0002,514,944
2Nov 8, 2025 08:1569,05449,681,30625,550,00002,510,848
3Nov 8, 2025 08:1569,06545,650,46624,532,0001,022,0002,519,040
4Nov 8, 2025 08:1569,17849,612,47125,596,00002,519,040
5Nov 8, 2025 08:1569,35160,088,92924,634,0001,026,0002,269,184
6Nov 8, 2025 08:1569,41452,595,45625,683,00002,506,752
7Nov 8, 2025 08:1569,65445,983,30923,790,0001,982,0002,531,328
8Nov 8, 2025 08:1569,80547,983,62524,835,000993,0002,265,088
9Nov 8, 2025 08:1569,83848,968,56323,853,0001,987,0002,506,752