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 14, 2025 12:55Yuriy LyfenkoYuriy LyfenkoScore: 59,178Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 14, 2025 12:5558,946543,510,39219,828,0001,982,0002,531,328
2Apr 14, 2025 12:5559,122543,441,69619,887,0001,988,0002,527,232
3Apr 14, 2025 12:5559,149549,463,56119,896,0001,989,0002,265,088
4Apr 14, 2025 12:5559,165543,323,48219,901,0001,990,0002,527,232
5Apr 14, 2025 12:5559,178547,875,31219,906,0001,990,0002,265,088
6Apr 14, 2025 12:5559,208547,186,82719,916,0001,991,0002,527,232
7Apr 14, 2025 12:5559,232550,421,38919,924,0001,992,0002,437,120
8Apr 14, 2025 12:5559,316543,037,76819,952,0001,995,0002,527,232
9Apr 14, 2025 12:5559,392547,787,97620,977,000998,0002,527,232