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 14, 2026 21:22Adam FolwarcznyAdam FolwarcznyScore: 19,781Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 14, 2026 21:2319,660672,870,737639,773,0008,996,0002,408,448
2Jan 14, 2026 21:2219,678680,070,185638,373,00010,989,0002,441,216
3Jan 14, 2026 21:2319,726673,233,384641,947,0008,999,0002,457,600
4Jan 14, 2026 21:2219,781679,692,951642,781,0009,996,0002,486,272
5Jan 14, 2026 21:2319,792679,115,935645,125,0008,001,0002,408,448
6Jan 14, 2026 21:2220,364696,642,662664,018,0007,988,0002,404,352