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 25, 2026 23:38Victor MerckléVictor MerckléScore: 3,434Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 25, 2026 23:393,401102,048,638268,823,0003,176,0002,654,208stderr
2Jun 25, 2026 23:393,407102,216,578271,552,0001,023,0002,658,304stderr
3Jun 25, 2026 23:393,418102,565,841273,223,0001,006,0002,658,304stderr
4Jun 25, 2026 23:393,422102,666,384270,867,0003,036,0002,654,208stderr
5Jun 25, 2026 23:393,434103,035,091271,209,0003,093,0002,658,304stderr
6Jun 25, 2026 23:393,440103,222,664271,238,0003,135,0002,658,304stderr
7Jun 25, 2026 23:393,485104,557,395272,591,0003,113,0002,658,304stderr
8Jun 25, 2026 23:393,511105,349,596276,030,0001,028,0002,658,304stderr
9Jun 25, 2026 23:393,536106,093,876273,833,0003,303,0002,654,208stderr