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 listMay 12, 2026 23:47Josu San MartinJosu San MartinScore: 3,934Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 12, 2026 23:483,924140,120,819128,374,0001,122,0002,113,536
2May 12, 2026 23:483,930140,392,928128,564,0001,128,0002,113,536
3May 12, 2026 23:483,930138,471,928128,588,0001,116,0002,113,536
4May 12, 2026 23:483,931144,484,178128,600,0001,126,0002,113,536
5May 12, 2026 23:483,934138,755,939128,706,0001,123,0002,113,536
6May 12, 2026 23:483,944138,934,725129,046,0001,120,0002,113,536
7May 12, 2026 23:483,947139,893,215129,136,0001,140,0002,113,536
8May 12, 2026 23:483,948139,055,553129,167,0001,131,0002,113,536
9May 12, 2026 23:483,979140,826,969130,212,0001,119,0002,113,536