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 24, 2026 04:18Victor MerckléVictor MerckléScore: 3,243Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 24, 2026 04:193,16895,050,663250,525,0003,143,0002,654,208
2Jun 24, 2026 04:193,17795,331,615248,056,0003,176,0002,650,112
3Jun 24, 2026 04:193,21696,495,360252,566,0002,040,0002,654,208
4Jun 24, 2026 04:193,21896,546,349250,928,0003,081,0002,654,208
5Jun 24, 2026 04:193,24397,303,824253,687,0003,027,0002,654,208
6Jun 24, 2026 04:193,24497,323,199253,396,0003,117,0002,654,208
7Jun 24, 2026 04:193,24497,332,448254,338,0002,085,0002,654,208
8Jun 24, 2026 04:193,27698,306,624256,497,0003,088,0002,654,208
9Jun 24, 2026 04:193,31499,441,462253,194,0003,065,0002,654,208