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 31, 2026 08:11Tomislav TunkovicTomislav TunkovicScore: 3,054Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 31, 2026 08:203,014107,692,15998,460,0001,030,00020,480
2Aug 31, 2026 08:203,022107,989,52798,712,0001,034,00020,480
3Aug 31, 2026 08:203,028108,260,00998,880,0001,045,00020,480
4Aug 31, 2026 08:203,046108,814,40399,484,0001,038,00020,480
5Aug 31, 2026 08:203,054109,190,49499,700,0001,084,00020,480
6Aug 31, 2026 08:203,060109,408,47999,942,0001,055,00020,480
7Aug 31, 2026 08:203,066110,436,218100,128,0001,074,00020,480
8Aug 31, 2026 08:203,067109,394,712100,175,0001,045,00020,480
9Aug 31, 2026 08:203,091110,268,221100,968,0001,038,00020,480