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 17:34Tomislav TunkovicTomislav TunkovicScore: 3,060Success
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 17:353,010107,796,64698,213,0001,118,00024,576
2Aug 15, 2026 17:353,018108,041,96098,492,0001,119,00024,576
3Aug 15, 2026 17:353,040108,733,04699,311,0001,029,00024,576
4Aug 15, 2026 17:353,052109,212,36999,708,0001,017,00024,576
5Aug 15, 2026 17:353,060109,450,44999,862,0001,135,00024,576
6Aug 15, 2026 17:353,060110,189,72999,987,0001,006,00024,576
7Aug 15, 2026 17:353,067110,240,548100,218,0001,014,00024,576
8Aug 15, 2026 17:353,068109,748,739100,250,0001,003,00024,576
9Aug 15, 2026 17:353,074109,888,727100,443,0001,015,00024,576