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 listOct 12, 2025 03:04Marco BarboneMarco BarboneScore: 48,133Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 12, 2025 03:0447,4721,591,082,4961,550,606,00015,985,0002,285,568
2Oct 12, 2025 03:0447,6631,602,989,0091,557,880,00014,989,0002,277,376
3Oct 12, 2025 03:0447,6811,604,744,5241,554,480,00018,981,0002,314,240
4Oct 12, 2025 03:0447,9611,609,535,5681,565,721,00016,986,0002,289,664
5Oct 12, 2025 03:0448,1331,619,417,1481,572,413,00015,973,0002,334,720
6Oct 12, 2025 03:0448,3841,623,983,6751,582,709,00013,970,0002,326,528
7Oct 12, 2025 03:0448,4451,630,354,9181,580,733,00017,962,0002,322,432
8Oct 12, 2025 03:0448,7591,642,284,4201,594,073,00014,972,0002,326,528
9Oct 12, 2025 03:0448,7741,637,818,3361,593,593,00015,965,0002,326,528