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 19:41Josu San MartinJosu San MartinScore: 3,321Success
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 19:433,315119,914,708108,375,0001,037,0002,113,536
2May 13, 2026 19:433,317121,356,839108,454,0001,038,0002,113,536
3May 13, 2026 19:433,317118,896,402108,449,0001,037,0002,113,536
4May 13, 2026 19:433,320118,660,847108,525,0001,044,0002,113,536
5May 13, 2026 19:433,321120,035,972108,567,0001,046,0002,113,536
6May 13, 2026 19:433,331120,655,157108,879,0001,054,0002,113,536
7May 13, 2026 19:433,332120,947,855108,936,0001,051,0002,113,536
8May 13, 2026 19:433,334118,801,106109,010,0001,032,0002,113,536
9May 13, 2026 19:433,337119,917,502109,094,0001,045,0002,117,632