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 listJun 6, 2026 12:38Victor MerckléVictor MerckléScore: 5,323Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 6, 2026 12:395,274158,244,160427,044,00018,676,0002,514,944
2Jun 6, 2026 12:395,300159,029,894427,049,00020,246,0002,514,944
3Jun 6, 2026 12:395,307159,230,682426,209,00020,821,0002,514,944
4Jun 6, 2026 12:395,318159,565,126428,835,00019,091,0002,514,944
5Jun 6, 2026 12:395,323159,716,230428,541,00019,061,0002,510,848
6Jun 6, 2026 12:395,341160,248,662428,931,00019,240,0002,510,848
7Jun 6, 2026 12:395,384161,545,892433,306,00019,480,0002,514,944
8Jun 6, 2026 12:395,397161,910,564435,340,00021,180,0002,506,752
9Jun 6, 2026 12:395,422162,674,058429,681,00023,067,0002,510,848