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:16Adam FolwarcznyAdam FolwarcznyScore: 75,110Success
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:1674,3572,477,603,6162,443,801,0009,995,0002,322,432
2Jan 12, 2026 21:1674,5122,484,078,4512,450,911,0007,996,0002,347,008
3Jan 12, 2026 21:1674,9542,502,839,8942,465,482,0007,995,0002,433,024
4Jan 12, 2026 21:1675,0932,502,747,4792,470,082,0007,997,0002,510,848
5Jan 12, 2026 21:1675,1102,514,467,1672,465,642,00012,992,0002,318,336
6Jan 12, 2026 21:1675,3642,517,976,0382,473,010,00013,994,0002,510,848
7Jan 12, 2026 21:1675,5142,523,907,9102,478,970,00012,994,0002,519,040
8Jan 12, 2026 21:1675,6212,522,276,4592,484,490,00010,993,0002,310,144
9Jan 12, 2026 21:1676,5142,553,277,5392,511,960,00012,994,0002,519,040