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 31, 2026 17:16olliecrowolliecrowScore: 20,983Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 31, 2026 17:1620,800716,935,320673,412,00012,988,0002,486,272
2Jan 31, 2026 17:1620,832712,399,527673,470,00013,989,0002,400,256
3Jan 31, 2026 17:1620,848714,513,001673,985,00013,999,0002,281,472
4Jan 31, 2026 17:1620,949722,611,090679,322,00011,988,0002,490,368
5Jan 31, 2026 17:1620,983726,152,675678,459,00013,988,0002,310,144
6Jan 31, 2026 17:1620,993716,409,185680,777,00011,996,0002,433,024
7Jan 31, 2026 17:1621,098727,752,660684,232,00011,986,0002,433,024
8Jan 31, 2026 17:1621,363734,339,645694,979,0009,985,0002,281,472
9Jan 31, 2026 17:1621,372727,892,477690,277,00014,984,0002,306,048