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:33Victor MerckléVictor MerckléScore: 3,657Success
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:343,585107,557,904290,704,0002,386,0002,400,256
2Jun 6, 2026 14:343,599107,979,443291,231,0003,293,0002,400,256
3Jun 6, 2026 14:343,605108,170,818291,252,0002,382,0002,400,256
4Jun 6, 2026 14:343,616108,485,946293,848,0002,380,0002,400,256
5Jun 6, 2026 14:343,657109,733,993295,357,0002,395,0002,396,160
6Jun 6, 2026 14:343,670110,107,915296,532,0003,289,0002,404,352
7Jun 6, 2026 14:343,677110,338,535291,181,0003,264,0002,396,160
8Jun 6, 2026 14:343,678110,357,611296,388,0002,293,0002,396,160
9Jun 6, 2026 14:343,720111,610,770300,543,0002,299,0002,396,160