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:07M-RochatM-RochatScore: 20,138Success
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:0819,876596,298,036581,788,0004,247,0002,113,536
2May 22, 2026 18:0820,033601,016,363586,930,0004,252,0002,113,536
3May 22, 2026 18:0820,111603,353,466589,551,0004,252,0002,113,536
4May 22, 2026 18:0820,118603,557,598588,825,0004,257,0002,113,536
5May 22, 2026 18:0820,138604,145,431588,857,0004,224,0002,113,536
6May 22, 2026 18:0820,160604,806,983590,231,0004,190,0002,113,536
7May 22, 2026 18:0820,311609,357,551593,913,0004,280,0002,113,536
8May 22, 2026 18:0821,505645,171,001630,282,0004,286,0002,113,536
9May 22, 2026 18:0821,564646,928,699633,124,0004,015,0002,113,536