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 19:37M-RochatM-RochatScore: 20,126Success
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 19:3819,824594,727,104580,250,0004,214,0002,113,536
2May 22, 2026 19:3819,852595,583,682578,836,0004,197,0002,113,536
3May 22, 2026 19:3819,969599,071,018584,957,0004,212,0002,113,536
4May 22, 2026 19:3820,097602,916,431586,317,0004,177,0002,113,536
5May 22, 2026 19:3820,126603,803,821587,582,0004,101,0002,113,536
6May 22, 2026 19:3820,200606,000,872592,192,0004,025,0002,113,536
7May 22, 2026 19:3820,312609,362,965591,969,0007,166,0002,113,536
8May 22, 2026 19:3820,797623,910,363609,838,0004,060,0002,113,536
9May 22, 2026 19:3820,913627,399,864613,211,0004,052,0002,113,536