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 listNov 21, 2025 00:02izotoffizotoffScore: 53,955Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 21, 2025 00:0253,6781,799,873,7221,755,374,00015,994,0002,523,136
2Nov 21, 2025 00:0253,8031,806,670,3291,760,489,00014,995,0002,330,624
3Nov 21, 2025 00:0253,9021,808,233,1771,765,770,00012,990,0002,330,624
4Nov 21, 2025 00:0253,9221,813,737,7141,759,429,00019,993,0002,330,624
5Nov 21, 2025 00:0253,9551,810,031,6561,765,518,00014,995,0002,330,624
6Nov 21, 2025 00:0254,2421,812,454,2401,765,999,00023,986,0002,330,624
7Nov 21, 2025 00:0254,3301,823,665,7691,775,915,00016,989,0002,453,504
8Nov 21, 2025 00:0254,3641,822,909,4711,773,021,00020,988,0002,330,624
9Nov 21, 2025 00:0256,3871,891,646,4371,838,787,00021,985,0002,330,624