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 13, 2026 16:03Tomislav TunkovicTomislav TunkovicScore: 7,988Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 13, 2026 16:047,929270,141,295257,280,0004,381,0002,121,728stderr
2Aug 13, 2026 16:047,940270,538,793257,745,0004,276,0002,121,728stderr
3Aug 13, 2026 16:047,963271,240,142258,418,0004,382,0002,121,728stderr
4Aug 13, 2026 16:047,965271,199,289258,639,0004,216,0002,121,728stderr
5Aug 13, 2026 16:047,988272,068,262259,330,0004,288,0002,121,728stderr
6Aug 13, 2026 16:048,005272,515,776259,750,0004,418,0002,121,728stderr
7Aug 13, 2026 16:048,007272,576,132259,819,0004,424,0002,121,728stderr
8Aug 13, 2026 16:048,009272,691,798259,847,0004,450,0002,121,728stderr
9Aug 13, 2026 16:048,015272,950,382260,052,0004,461,0002,121,728stderr