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 21:35Adam FolwarcznyAdam FolwarcznyScore: 89,857Success
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 21:3589,0402,964,268,9362,923,314,00014,991,0002,277,376
2Jan 12, 2026 21:3589,8572,993,819,6932,949,300,00015,990,0002,277,376
3Jan 12, 2026 21:3590,0952,999,837,1762,959,138,00013,991,0002,519,040