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 8, 2026 03:32Victor MerckléVictor MerckléScore: 4,268Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 8, 2026 03:334,173125,218,334340,306,0002,316,0002,428,928
2Jun 8, 2026 03:334,200126,003,523341,397,0002,298,0002,424,832
3Jun 8, 2026 03:334,218126,559,902342,639,0002,139,0002,424,832
4Jun 8, 2026 03:334,252127,576,286346,120,0002,130,0002,428,928
5Jun 8, 2026 03:334,268128,055,293346,002,0002,173,0002,424,832
6Jun 8, 2026 03:334,292128,783,980343,488,0003,089,0002,433,024
7Jun 8, 2026 03:334,294128,842,852348,190,0002,229,0002,424,832
8Jun 8, 2026 03:334,322129,669,512349,708,0002,322,0002,428,928
9Jun 8, 2026 03:334,370131,113,229353,825,0002,273,0002,428,928