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 listJul 27, 2024 16:51Matthew SillsMatthew SillsScore: 21,290,972Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 27, 2024 16:5121,257,5237,921,622,2777,865,283,33502,297,856
2Jul 27, 2024 16:5121,290,9727,941,756,4957,877,659,45502,289,664
3Jul 27, 2024 16:5121,363,6337,970,893,5737,904,544,14202,297,856