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 listMar 19, 2026 03:38Dominique GarmierDominique GarmierScore: 13,214Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 19, 2026 03:2812,960388,805,0381,058,687,0007,982,0002,560,000
2Mar 19, 2026 03:2813,112393,350,3811,047,344,0009,974,0002,576,384
3Mar 19, 2026 03:4313,173395,195,4191,068,353,0009,993,0002,711,552
4Mar 19, 2026 03:4313,179395,367,9511,057,373,0007,995,0002,576,384
5Mar 19, 2026 03:3813,214396,427,2391,071,523,0007,981,0002,707,456
6Mar 19, 2026 03:2813,302399,069,2691,085,604,0006,978,0002,977,792
7Mar 19, 2026 03:3813,333400,001,4091,080,822,0009,970,0002,600,960
8Mar 19, 2026 03:4313,395401,863,2251,077,571,0009,977,0002,658,304
9Mar 19, 2026 03:3813,481404,423,9421,095,593,0004,989,0002,576,384