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 16, 2025 01:30emily graceemily graceScore: 126,554Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 16, 2025 01:30126,14172,437,99345,658,0001,014,0002,289,664
2Apr 16, 2025 01:30126,55477,652,02345,829,000996,0002,277,376
3Apr 16, 2025 01:30126,59779,139,50644,848,0001,993,0002,289,664