Unique strings Sergey Svistunov

Count the exact number of unique tokens as fast as possible.

Input

One token per line on STDIN:

JWXcKKaWzvFL5
Rof
3ztCpA
5wHcGN
*UiEMthaTS*g

Output

Print the exact count of unique tokens to STDOUT.

Constraints

  • Character set: 0123456789abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ@#%*
  • Maximum token length: 16
  • Approximately 1,000,000 unique tokens
Back to listJul 23, 2026 17:31boop34boop34Score: 11,134Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 23, 2026 17:3210,950371,088,900356,331,0005,021,0002,113,536
2Jul 23, 2026 17:3210,980372,173,060357,294,0005,047,0002,113,536
3Jul 23, 2026 17:3211,124376,884,846361,955,0005,152,0002,113,536
4Jul 23, 2026 17:3211,133377,082,134362,304,0005,085,0002,113,536
5Jul 23, 2026 17:3211,134377,318,806362,475,0004,972,0002,113,536
6Jul 23, 2026 17:3211,151377,762,567362,880,0005,118,0002,113,536
7Jul 23, 2026 17:3211,175378,693,630363,766,0005,022,0002,113,536
8Jul 23, 2026 17:3211,196379,284,244364,472,0005,011,0002,113,536
9Jul 23, 2026 17:3211,198379,371,241364,330,0005,223,0002,113,536