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 listJun 27, 2026 03:00Victor MerckléVictor MerckléScore: 4,814Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 27, 2026 03:014,804166,160,191121,757,00036,794,0002,113,536
2Jun 27, 2026 03:014,810166,337,012122,031,00036,720,0002,113,536
3Jun 27, 2026 03:014,810166,643,398122,045,00036,709,0002,113,536
4Jun 27, 2026 03:014,813166,734,155122,073,00036,783,0002,113,536
5Jun 27, 2026 03:014,814166,742,401122,070,00036,823,0002,113,536
6Jun 27, 2026 03:014,815166,873,393122,063,00036,837,0002,113,536
7Jun 27, 2026 03:014,836167,505,201122,805,00036,787,0002,113,536
8Jun 27, 2026 03:014,837167,667,911122,585,00037,037,0002,113,536
9Jun 27, 2026 03:014,851168,203,068122,465,00037,633,0002,113,536