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 16:21emily graceemily graceScore: 943,843Success
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 16:21879,735356,187,793266,592,00058,910,0002,416,640
2Apr 18, 2025 16:21943,843376,957,120297,189,00052,033,0002,338,816
3Apr 18, 2025 16:211,230,500480,358,011327,205,000128,080,0002,273,280