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 listMay 22, 2026 18:21M-RochatM-RochatScore: 20,273Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 22, 2026 18:2220,069602,096,281587,210,0004,011,0002,113,536
2May 22, 2026 18:2220,133603,993,171590,672,0003,012,0002,113,536
3May 22, 2026 18:2220,232606,975,809590,504,0004,038,0002,113,536
4May 22, 2026 18:2220,232606,970,026593,401,0004,058,0002,113,536
5May 22, 2026 18:2220,273608,210,480593,443,0003,008,0002,113,536
6May 22, 2026 18:2220,349610,487,717597,722,0003,011,0002,113,536
7May 22, 2026 18:2221,459643,778,531630,258,0004,092,0002,113,536
8May 22, 2026 18:2221,650649,513,210633,054,0004,114,0002,113,536
9May 22, 2026 18:2221,748652,455,110636,580,0004,079,0002,113,536