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 2, 2026 17:10zielajzielajScore: 3,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 2, 2026 17:063,358132,263,582109,826,000998,0002,273,280
2Jan 2, 2026 17:053,362128,561,128108,932,0001,998,0002,273,280
3Jan 2, 2026 17:103,376140,655,648109,390,0002,007,0002,424,832
4Jan 2, 2026 17:053,417143,116,912111,758,000997,0002,424,832
5Jan 2, 2026 17:063,437140,022,675112,433,0001,003,0002,396,160
6Jan 2, 2026 17:103,441146,687,632111,545,0002,009,0002,273,280
7Jan 2, 2026 17:053,454137,826,060111,989,0001,999,0002,273,280
8Jan 2, 2026 17:103,459135,988,766113,157,0001,001,0002,269,184
9Jan 2, 2026 17:063,477142,576,444113,755,000997,0002,535,424