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 23:15Adam FolwarcznyAdam FolwarcznyScore: 22,280Success
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 23:1522,171758,306,066720,649,00010,994,0002,347,008
2Jan 12, 2026 23:1522,180760,725,024721,952,0009,999,0002,494,464
3Jan 12, 2026 23:1522,227759,143,550723,498,0009,993,0002,347,008
4Jan 12, 2026 23:1522,265765,747,807723,756,00010,996,0002,498,560
5Jan 12, 2026 23:1522,280760,416,573728,251,0006,992,0002,473,984
6Jan 12, 2026 23:1522,316762,125,847727,428,0008,992,0002,473,984
7Jan 12, 2026 23:1522,374763,658,704726,358,00011,989,0002,519,040
8Jan 12, 2026 23:1522,404765,011,379732,323,0006,993,0002,519,040
9Jan 12, 2026 23:1523,060787,004,692753,002,0007,989,0002,342,912