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 25, 2025 10:16Cameron AavikCameron AavikScore: 24,624Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 25, 2025 10:1624,585837,294,458787,331,00023,979,0002,289,664
2Jan 25, 2025 10:1624,591844,612,919782,524,00028,982,0002,330,624
3Jan 25, 2025 10:1624,607841,831,238783,018,00029,000,0002,424,832
4Jan 25, 2025 10:1624,616837,217,171786,350,00025,978,0002,428,928
5Jan 25, 2025 10:1624,624844,527,033790,619,00021,989,0002,420,736
6Jan 25, 2025 10:1624,724847,920,418797,909,00017,997,0002,408,448
7Jan 25, 2025 10:1624,782845,041,378793,818,00023,994,0002,424,832
8Jan 25, 2025 10:1624,836847,742,265793,592,00025,986,0002,433,024
9Jan 25, 2025 10:1625,378863,897,212813,528,00023,956,0002,293,760