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 19:37emily graceemily graceScore: 71,176Success
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 19:3770,50548,450,78524,081,0002,006,0002,265,088
2Apr 18, 2025 19:3771,17658,882,96125,323,0001,012,0002,273,280
3Apr 18, 2025 19:3771,32448,401,72725,375,0001,015,0002,289,664