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 listJul 8, 2026 20:49IlyaIlyaScore: 62,248Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 8, 2026 20:5061,89732,537,01521,788,0001,114,0002,113,536
2Jul 8, 2026 20:5062,11632,657,93121,816,0001,167,0002,113,536
3Jul 8, 2026 20:5062,21032,722,16221,892,0001,126,0002,113,536
4Jul 8, 2026 20:5062,24332,746,16921,915,0001,115,0002,113,536
5Jul 8, 2026 20:5062,24832,615,42921,930,0001,102,0002,113,536
6Jul 8, 2026 20:5062,35432,695,18221,946,0001,125,0002,113,536
7Jul 8, 2026 20:5062,44532,781,51421,902,0001,203,0002,113,536
8Jul 8, 2026 20:5062,60233,438,61921,916,0001,247,0002,113,536
9Jul 8, 2026 20:5062,70832,916,66822,043,0001,159,0002,113,536