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 listAug 15, 2026 14:46Tomislav TunkovicTomislav TunkovicScore: 3,567Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 15, 2026 14:473,537125,046,159115,619,0001,134,00024,576
2Aug 15, 2026 14:473,538126,384,703115,667,0001,114,00024,576
3Aug 15, 2026 14:473,558125,854,582116,421,0001,022,00024,576
4Aug 15, 2026 14:473,560125,667,855116,473,0001,009,00024,576
5Aug 15, 2026 14:473,567126,100,679116,704,0001,008,00024,576
6Aug 15, 2026 14:473,571126,209,406116,737,0001,117,00024,576
7Aug 15, 2026 14:473,588126,886,697117,293,0001,129,00024,576
8Aug 15, 2026 14:473,591126,789,399117,512,0001,002,00024,576
9Aug 15, 2026 14:473,601127,256,928117,855,0001,004,00024,576