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 listDec 12, 2024 18:39Yuriy LyfenkoYuriy LyfenkoScore: 59,668Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 12, 2024 18:3959,46243,263,18520,001,0002,000,0002,433,024
2Dec 12, 2024 18:4059,46844,682,38520,003,0002,000,0002,433,024
3Dec 12, 2024 18:4059,65145,353,68920,065,0002,006,0002,445,312
4Dec 12, 2024 18:4059,66845,860,43120,070,0002,007,0002,531,328
5Dec 12, 2024 18:3959,68150,299,23020,075,0002,007,0002,441,216
6Dec 12, 2024 18:3959,84650,518,27220,130,0002,013,0002,527,232