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 listJan 22, 2025 20:36Gerard SmitGerard SmitScore: 149,437Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 22, 2025 20:36148,2644,931,722,2684,867,716,00024,983,0002,502,656
2Jan 22, 2025 20:36148,8624,943,496,2724,886,469,00025,981,0002,465,792
3Jan 22, 2025 20:36149,2834,954,656,0594,907,362,00018,989,0002,461,696
4Jan 22, 2025 20:36149,3324,961,637,4464,908,978,00018,988,0002,285,568
5Jan 22, 2025 20:36149,4374,961,770,3194,911,416,00019,989,0002,396,160
6Jan 22, 2025 20:36151,3995,027,049,6634,964,180,00031,981,0002,367,488
7Jan 22, 2025 20:36151,6355,034,030,5634,977,974,00025,984,0002,531,328
8Jan 22, 2025 20:36158,5235,257,959,4135,212,276,00018,990,0002,498,560
9Jan 22, 2025 20:36160,5885,334,573,0875,276,406,00022,984,0002,371,584