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 13, 2026 12:41Josu San MartinJosu San MartinScore: 3,461Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 13, 2026 12:423,430122,022,518111,949,0001,270,0002,113,536
2May 13, 2026 12:423,434122,110,889112,320,0001,009,0002,113,536
3May 13, 2026 12:423,441125,152,510112,305,0001,265,0002,113,536
4May 13, 2026 12:423,461124,377,399113,208,0001,012,0002,113,536
5May 13, 2026 12:423,461124,870,884112,968,0001,255,0002,113,536
6May 13, 2026 12:423,464125,046,985113,085,0001,251,0002,113,536
7May 13, 2026 12:423,468125,037,724113,193,0001,259,0002,113,536
8May 13, 2026 12:423,470124,525,327113,502,0001,022,0002,113,536
9May 13, 2026 12:423,474125,254,109113,658,0001,012,0002,113,536