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 listApr 18, 2025 19:58KeefeKeefeScore: 77,973Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 18, 2025 19:5977,28957,120,06928,597,00002,400,256
2Apr 18, 2025 19:5877,46555,432,43127,639,0001,023,0002,273,280
3Apr 18, 2025 19:5977,95157,585,67927,848,000994,0002,273,280
4Apr 18, 2025 19:5877,97356,910,11527,856,000994,0002,273,280
5Apr 18, 2025 19:5878,00857,334,43526,873,0001,990,0002,400,256
6Apr 18, 2025 19:5978,00862,212,86026,873,0001,990,0002,396,160