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 listJun 22, 2025 06:00Ian MckibbenIan MckibbenScore: 17,539Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 22, 2025 06:0017,402606,274,545493,365,00080,895,0002,527,232
2Jun 22, 2025 06:0017,432601,810,428484,364,00090,880,0002,531,328
3Jun 22, 2025 06:0017,434595,921,196485,436,00089,895,0002,285,568
4Jun 22, 2025 06:0017,521608,887,491508,157,00070,021,0002,531,328
5Jun 22, 2025 06:0017,539602,425,030492,825,00085,969,0002,285,568
6Jun 22, 2025 06:0017,572600,637,830497,896,00081,983,0002,281,472
7Jun 22, 2025 06:0017,579609,398,086502,089,00078,013,0002,281,472
8Jun 22, 2025 06:0017,640604,942,560500,093,00082,015,0002,375,680
9Jun 22, 2025 06:0017,708607,334,551496,473,00087,906,0002,523,136