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 11:16M-RochatM-RochatScore: 20,952Success
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 11:1720,548616,450,907600,261,0004,129,0002,113,536
2May 22, 2026 11:1720,601618,038,928602,415,0004,091,0002,113,536
3May 22, 2026 11:1720,797623,929,426607,776,0004,082,0002,113,536
4May 22, 2026 11:1720,814624,438,912610,935,0004,076,0002,113,536
5May 22, 2026 11:1720,952628,578,165613,154,0004,126,0002,113,536
6May 22, 2026 11:1721,064631,939,134616,082,0004,088,0002,113,536
7May 22, 2026 11:1721,160634,816,656618,493,0004,134,0002,113,536
8May 22, 2026 11:1721,163634,915,629618,773,0004,115,0002,113,536
9May 22, 2026 11:1721,235637,061,111620,625,0004,212,0002,113,536