Unique strings v2 Sergey Svistunov

Same problem as Unique strings, but with 3 CPUs available and scoring based on wall time instead of CPU time.

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 listMay 3, 2026 20:16TudyMTudyMScore: 23,579Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 3, 2026 20:1723,505705,153,216621,373,00066,862,0002,408,448
2May 3, 2026 20:1723,525705,754,417622,599,00068,844,0002,359,296
3May 3, 2026 20:1723,550706,510,217622,103,00069,028,0002,392,064
4May 3, 2026 20:1723,579707,399,631623,531,00066,963,0002,396,160
5May 3, 2026 20:1723,579707,377,974622,586,00068,886,0002,387,968
6May 3, 2026 20:1723,607708,230,969624,597,00067,879,0002,371,584
7May 3, 2026 20:1723,615708,454,224621,900,00068,988,0002,379,776
8May 3, 2026 20:1723,729711,898,537624,354,00068,894,0002,347,008
9May 3, 2026 20:1724,178725,364,923636,868,00071,433,0002,392,064