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 15, 2026 22:38Adam FolwarcznyAdam FolwarcznyScore: 11,393Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 15, 2026 22:3811,321396,067,924358,605,00014,983,0002,379,776
2Jan 15, 2026 22:3811,349404,685,841359,533,00014,980,0002,371,584
3Jan 15, 2026 22:3811,351394,007,250360,612,00013,984,0002,375,680
4Jan 15, 2026 22:3811,362400,264,877358,952,00015,997,0002,375,680
5Jan 15, 2026 22:3811,393401,804,988359,962,00015,998,0002,469,888
6Jan 15, 2026 22:3811,408400,530,533358,499,00017,974,0002,531,328
7Jan 15, 2026 22:3811,443404,720,362361,643,00015,984,0002,375,680
8Jan 15, 2026 22:3811,512400,485,924365,904,00013,996,0002,330,624
9Jan 15, 2026 22:3811,629411,464,576365,779,00017,989,0002,531,328