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 20:17Victor MerckléVictor MerckléScore: 3,412Success
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 20:183,393119,794,075110,817,0001,162,0002,113,536
2Jun 27, 2026 20:183,398119,895,434111,011,0001,130,0002,113,536
3Jun 27, 2026 20:183,403120,040,886111,149,0001,170,0002,113,536
4Jun 27, 2026 20:183,406120,298,601111,250,0001,174,0002,113,536
5Jun 27, 2026 20:183,412120,548,551111,447,0001,161,0002,113,536
6Jun 27, 2026 20:183,414120,463,376111,487,0001,182,0002,113,536
7Jun 27, 2026 20:183,493132,438,138114,069,0001,217,0002,113,536
8Jun 27, 2026 20:183,531132,547,848115,213,0001,310,0002,113,536
9Jun 27, 2026 20:183,534132,988,813115,400,0001,235,0002,113,536