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:03Adam FolwarcznyAdam FolwarcznyScore: 24,715Success
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:0324,597836,617,114803,702,0007,997,0002,347,008
2Jan 12, 2026 23:0324,662841,166,737806,857,0006,998,0002,510,848
3Jan 12, 2026 23:0324,680840,105,845807,445,0006,995,0002,285,568
4Jan 12, 2026 23:0324,693842,709,321808,882,0005,999,0002,355,200
5Jan 12, 2026 23:0324,715840,202,737808,604,0006,996,0002,519,040
6Jan 12, 2026 23:0324,763844,430,675810,197,0006,993,0002,428,928
7Jan 12, 2026 23:0324,764841,625,498811,228,0005,994,0002,351,104
8Jan 12, 2026 23:0324,806851,733,982810,617,0007,996,0002,473,984
9Jan 12, 2026 23:0325,521872,969,289833,197,0008,991,0002,519,040