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:07Victor MerckléVictor MerckléScore: 4,503Success
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:084,416132,497,102363,667,0004,646,0002,646,016
2Jun 6, 2026 14:084,457133,725,017369,053,0004,311,0002,646,016
3Jun 6, 2026 14:084,480134,427,093365,668,0005,455,0002,641,920
4Jun 6, 2026 14:084,501135,039,870372,686,0003,279,0002,646,016
5Jun 6, 2026 14:084,503135,104,504368,270,0005,519,0002,641,920
6Jun 6, 2026 14:084,513135,408,951371,606,0004,489,0002,646,016
7Jun 6, 2026 14:084,521135,635,174371,842,0005,538,0002,646,016
8Jun 6, 2026 14:084,554136,621,889374,782,0004,302,0002,641,920
9Jun 6, 2026 14:084,563136,904,222367,597,0004,310,0002,646,016