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 16, 2025 02:00Ian MckibbenIan MckibbenScore: 28,005Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 16, 2025 02:0027,836944,137,267825,626,00092,957,0002,396,160
2Jan 16, 2025 02:0027,880948,067,031835,126,00084,911,0002,359,296
3Jan 16, 2025 02:0027,889942,616,725836,385,00083,938,0002,392,064
4Jan 16, 2025 02:0027,954947,308,901834,539,00087,951,0002,506,752
5Jan 16, 2025 02:0028,005948,505,565836,256,00087,921,0002,379,776
6Jan 16, 2025 02:0028,049952,114,171846,639,00078,966,0002,330,624
7Jan 16, 2025 02:0028,148955,830,179837,996,00090,891,0002,281,472
8Jan 16, 2025 02:0028,203956,422,814853,811,00076,892,0002,387,968
9Jan 16, 2025 02:0028,283965,020,794844,388,00088,935,0002,371,584