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 listApr 28, 2026 17:58Victor MerckléVictor MerckléScore: 9,487Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 28, 2026 17:599,222276,669,350726,523,00043,971,0002,772,992
2Apr 28, 2026 17:599,306279,191,716727,880,00043,932,0002,756,608
3Apr 28, 2026 17:599,312279,378,115721,845,00047,989,0002,748,416
4Apr 28, 2026 17:599,363280,896,728720,838,00049,988,0002,605,056
5Apr 28, 2026 17:599,487284,635,355724,759,00044,985,0002,412,544
6Apr 28, 2026 17:599,496284,898,960713,485,00057,958,0002,428,928
7Apr 28, 2026 17:599,561286,858,689720,515,00045,969,0002,400,256
8Apr 28, 2026 17:599,694290,838,650718,461,00039,970,0002,723,840
9Apr 28, 2026 17:599,785293,562,491745,592,00039,924,0002,637,824