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 3, 2025 00:14tkaltkalScore: 262,020Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 3, 2025 00:14260,4168,622,619,5598,532,759,00060,962,0002,314,240
2Jan 3, 2025 00:14260,4538,632,284,4748,522,987,00071,966,0002,396,160
3Jan 3, 2025 00:14261,2338,651,168,9958,550,721,00069,956,0002,285,568
4Jan 3, 2025 00:14261,6088,666,889,2508,568,108,00064,962,0002,297,856
5Jan 3, 2025 00:14262,0208,681,085,8218,580,707,00065,959,0002,285,568
6Jan 3, 2025 00:14262,7138,701,267,7328,601,569,00067,957,0002,347,008
7Jan 3, 2025 00:14263,3098,729,545,0048,623,245,00065,955,0002,289,664
8Jan 3, 2025 00:14263,8558,739,371,4408,636,259,00070,952,0002,338,816
9Jan 3, 2025 00:14263,9158,744,391,4998,636,229,00072,959,0002,359,296