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 11, 2026 15:11Victor MerckléVictor MerckléScore: 3,261Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 11, 2026 15:123,22796,812,593255,870,00002,138,112
2Jun 11, 2026 15:123,23997,194,292253,718,0001,030,0002,138,112
3Jun 11, 2026 15:123,24397,299,160255,611,00002,138,112
4Jun 11, 2026 15:123,24797,421,597256,413,00002,138,112
5Jun 11, 2026 15:123,26197,843,164258,845,00002,138,112
6Jun 11, 2026 15:123,26297,867,086257,819,00002,138,112
7Jun 11, 2026 15:123,27298,182,109257,701,00002,138,112
8Jun 11, 2026 15:123,27798,328,840258,362,00002,138,112
9Jun 11, 2026 15:123,28798,623,521259,567,00002,138,112