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 16:03Josu San MartinJosu San MartinScore: 3,462Success
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 16:043,428123,298,231111,949,0001,195,0002,113,536
2May 13, 2026 16:043,428121,949,402112,103,0001,050,0002,113,536
3May 13, 2026 16:043,430122,052,010112,165,0001,055,0002,113,536
4May 13, 2026 16:043,431123,832,900112,188,0001,064,0002,113,536
5May 13, 2026 16:043,462124,869,606113,199,0001,047,0002,113,536
6May 13, 2026 16:043,479123,674,060113,758,0001,050,0002,113,536
7May 13, 2026 16:043,505124,688,729114,623,0001,053,0002,113,536
8May 13, 2026 16:043,519125,053,698115,084,0001,064,0002,113,536
9May 13, 2026 16:043,546127,692,298115,964,0001,074,0002,113,536