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:39emily graceemily graceScore: 70,059Success
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:4069,81445,844,86023,844,0001,987,0002,273,280
2Apr 18, 2025 19:3969,89251,928,24723,871,0001,989,0002,289,664
3Apr 18, 2025 19:4070,04153,751,61223,922,0001,993,0002,269,184
4Apr 18, 2025 19:3970,05956,525,39624,925,000997,0002,289,664
5Apr 18, 2025 19:3970,34348,557,02724,025,0002,002,0002,281,472
6Apr 18, 2025 19:4070,45948,442,92724,065,0002,005,0002,269,184