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 26, 2026 17:20Shikhar SoniShikhar SoniScore: 35,125Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 26, 2026 17:2134,9891,049,687,3041,029,608,00010,139,0002,125,824
2Jun 26, 2026 17:2135,0041,050,134,1451,030,257,0009,954,0002,125,824
3Jun 26, 2026 17:2135,0441,051,341,3921,031,366,0009,995,0002,125,824
4Jun 26, 2026 17:2135,1221,053,670,1331,033,207,00010,543,0002,125,824
5Jun 26, 2026 17:2135,1251,053,772,2411,032,704,00011,049,0002,125,824
6Jun 26, 2026 17:2135,1481,054,466,8381,033,967,00010,634,0002,125,824
7Jun 26, 2026 17:2135,2121,056,377,3471,036,293,00010,154,0002,125,824
8Jun 26, 2026 17:2135,2401,057,209,9011,036,159,00010,708,0002,125,824
9Jun 26, 2026 17:2135,2961,058,903,3081,037,404,00011,177,0002,125,824