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:14M-RochatM-RochatScore: 20,340Success
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:1519,763592,916,656577,509,0004,020,0002,113,536
2May 22, 2026 18:1519,962598,871,445583,798,0004,137,0002,113,536
3May 22, 2026 18:1520,093602,819,050588,527,0004,105,0002,113,536
4May 22, 2026 18:1520,309609,272,744595,815,0004,056,0002,113,536
5May 22, 2026 18:1520,340610,229,209594,977,0004,190,0002,113,536
6May 22, 2026 18:1520,805624,163,508610,814,0004,106,0002,113,536
7May 22, 2026 18:1521,378641,343,346627,044,0004,164,0002,113,536
8May 22, 2026 18:1521,709651,293,092635,957,0004,128,0002,113,536
9May 22, 2026 18:1521,734652,031,396636,089,0004,079,0002,113,536