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:06emily graceemily graceScore: 137,416Success
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:06137,37683,950,56548,836,0001,993,0002,277,376
2Apr 16, 2025 01:06137,41681,196,05748,851,0001,993,0002,281,472
3Apr 16, 2025 01:06137,45771,421,43549,862,000997,0002,371,584