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 18, 2026 01:48M-RochatM-RochatScore: 18,580Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 18, 2026 01:4918,382617,697,396603,614,0003,011,0002,113,536
2May 18, 2026 01:4918,397616,913,292603,089,0004,013,0002,113,536
3May 18, 2026 01:4918,473621,071,915605,561,0004,053,0002,113,536
4May 18, 2026 01:4918,519620,751,155607,143,0004,009,0002,113,536
5May 18, 2026 01:4918,580622,614,721609,073,0004,097,0002,113,536
6May 18, 2026 01:4918,734628,027,431614,201,0004,040,0002,113,536
7May 18, 2026 01:4918,971635,644,132622,013,0004,055,0002,113,536
8May 18, 2026 01:4919,865667,705,543651,529,0004,027,0002,113,536
9May 18, 2026 01:4919,908668,374,007652,915,0004,077,0002,113,536