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:49Adam FolwarcznyAdam FolwarcznyScore: 11,398Success
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:4911,344401,907,089357,350,00017,016,0002,375,680
2Jan 15, 2026 22:4911,350401,383,980360,569,00013,983,0002,498,560
3Jan 15, 2026 22:4911,359401,445,408356,840,00017,991,0002,494,464
4Jan 15, 2026 22:4911,374397,690,999354,312,00021,018,0002,514,944
5Jan 15, 2026 22:4911,398398,199,609358,136,00018,006,0002,375,680
6Jan 15, 2026 22:4911,476404,697,652365,710,00012,989,0002,269,184
7Jan 15, 2026 22:4911,481406,875,811364,894,00013,995,0002,469,888
8Jan 15, 2026 22:4911,740409,609,337372,453,00014,978,0002,523,136
9Jan 15, 2026 22:4911,872412,662,501375,800,00015,991,0002,269,184