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 14:18Victor MerckléVictor MerckléScore: 6,544Success
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 14:196,526195,805,305548,636,00010,525,0002,584,576
2Jun 6, 2026 14:196,527195,826,194547,945,00012,338,0002,580,480
3Jun 6, 2026 14:196,528195,865,642548,089,00012,253,0002,580,480
4Jun 6, 2026 14:196,543196,294,816548,916,00013,053,0002,580,480
5Jun 6, 2026 14:196,544196,322,940549,274,00012,533,0002,580,480
6Jun 6, 2026 14:196,547196,420,199548,989,00012,806,0002,580,480
7Jun 6, 2026 14:196,595197,863,541549,049,00012,780,0002,580,480
8Jun 6, 2026 14:196,649199,492,230558,833,00012,709,0002,580,480
9Jun 6, 2026 14:196,731201,954,103566,299,00012,417,0002,580,480