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 listNov 5, 2026 04:43e1011e1011Score: 29,562Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 5, 2026 04:4729,510985,271,270942,487,00031,354,0002,113,536
2Nov 5, 2026 04:4729,528985,875,277942,483,00031,959,0002,113,536
3Nov 5, 2026 04:4729,529985,426,394943,291,00031,182,0002,113,536
4Nov 5, 2026 04:4729,547986,627,453943,005,00032,074,0002,113,536
5Nov 5, 2026 04:4729,562986,571,917943,218,00032,359,0002,113,536
6Nov 5, 2026 04:4729,570986,783,599943,228,00032,614,0002,113,536
7Nov 5, 2026 04:4729,636988,854,968946,043,00031,946,0002,113,536
8Nov 5, 2026 04:4729,658990,169,545946,596,00032,125,0002,113,536
9Nov 5, 2026 04:4729,679990,741,698948,033,00031,388,0002,113,536