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:07Adam FolwarcznyAdam FolwarcznyScore: 22,233Success
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:0722,139758,905,646722,583,0007,995,0002,510,848
2Jan 12, 2026 23:0722,185762,216,833724,094,0008,001,0002,510,848
3Jan 12, 2026 23:0722,213764,272,631725,034,0008,000,0002,510,848
4Jan 12, 2026 23:0722,228759,004,959724,545,0008,994,0002,461,696
5Jan 12, 2026 23:0722,233761,102,693724,688,0008,996,0002,506,752
6Jan 12, 2026 23:0722,258766,890,305726,506,0007,994,0002,355,200
7Jan 12, 2026 23:0722,262763,050,550728,643,0005,997,0002,400,256
8Jan 12, 2026 23:0722,346763,379,708730,415,0006,994,0002,347,008
9Jan 12, 2026 23:0723,128788,757,135756,236,0006,992,0002,519,040