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:06emily graceemily graceScore: 72,522Success
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:0671,65953,530,03826,514,00002,273,280
2Apr 18, 2025 19:0671,83552,991,45025,557,0001,022,0002,281,472
3Apr 18, 2025 19:0672,04356,106,98925,631,0001,025,0002,289,664
4Apr 18, 2025 19:0672,10552,748,57925,653,0001,026,0002,277,376
5Apr 18, 2025 19:0672,52256,031,80425,840,000993,0002,289,664
6Apr 18, 2025 19:0672,54163,668,58825,846,000994,0002,289,664
7Apr 18, 2025 19:0672,55959,212,97925,853,000994,0002,281,472
8Apr 18, 2025 19:0672,56254,139,93624,860,0001,988,0002,281,472
9Apr 18, 2025 19:0672,57354,510,52924,863,0001,989,0002,269,184