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 12, 2026 22:09Adam FolwarcznyAdam FolwarcznyScore: 59,587Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 12, 2026 22:0959,2551,985,259,6161,943,420,00011,996,0002,289,664
2Jan 12, 2026 22:0959,2971,983,574,7181,943,821,00012,992,0002,301,952
3Jan 12, 2026 22:0959,3001,983,380,8021,943,902,00012,992,0002,461,696
4Jan 12, 2026 22:0959,5531,991,319,7051,951,259,00013,994,0002,494,464
5Jan 12, 2026 22:0959,5871,993,217,3641,950,377,00015,994,0002,469,888
6Jan 12, 2026 22:0959,6501,996,830,4811,957,469,00010,997,0002,461,696
7Jan 12, 2026 22:0959,6741,993,271,0951,957,255,00011,995,0002,273,280
8Jan 12, 2026 22:0959,8342,005,297,9051,961,542,00012,990,0002,273,280
9Jan 12, 2026 22:0959,9382,001,217,2471,968,958,0008,995,0002,396,160