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 21:00Drew GarciaDrew GarciaScore: 76,970Success
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 21:0076,56253,954,31625,293,0003,035,0002,277,376
2Apr 18, 2025 21:0276,70551,548,37427,368,0001,013,0002,273,280
3Apr 18, 2025 21:0276,89251,239,35626,418,0002,032,0002,281,472
4Apr 18, 2025 21:0076,97050,545,00427,462,0001,017,0002,396,160
5Apr 18, 2025 21:0077,02454,207,68228,499,00002,281,472
6Apr 18, 2025 21:0277,44959,045,12725,586,0003,070,0002,281,472