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 01:24Chandrasekaran AkashChandrasekaran AkashScore: 61,811Success
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 01:2461,72745,481,58921,846,000993,0002,531,328
2Apr 18, 2025 01:2461,75150,482,37121,855,000993,0002,449,408
3Apr 18, 2025 01:2461,75151,739,13721,855,000993,0002,441,216
4Apr 18, 2025 01:2461,77649,198,72621,864,000993,0002,449,408
5Apr 18, 2025 01:2461,81146,702,57321,831,0001,039,0002,531,328
6Apr 18, 2025 01:2461,84147,340,40621,887,000994,0002,269,184
7Apr 18, 2025 01:2461,95951,156,68221,929,000996,0002,437,120
8Apr 18, 2025 01:2462,00846,339,94821,946,000997,0002,441,216
9Apr 18, 2025 01:2462,08443,207,49421,973,000998,0002,441,216