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:22M-RochatM-RochatScore: 20,378Success
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:2220,143604,296,092589,814,0004,100,0002,113,536
2May 22, 2026 11:2220,186605,607,603591,546,0004,141,0002,113,536
3May 22, 2026 11:2220,335610,055,631596,455,0004,015,0002,113,536
4May 22, 2026 11:2220,358610,752,298594,939,0004,124,0002,113,536
5May 22, 2026 11:2220,378611,351,368597,330,0004,103,0002,113,536
6May 22, 2026 11:2220,386611,587,241597,777,0004,136,0002,113,536
7May 22, 2026 11:2221,783653,513,281637,362,0004,033,0002,113,536
8May 22, 2026 11:2221,856655,704,152640,231,0004,009,0002,113,536
9May 22, 2026 11:2221,925657,779,706641,623,0004,158,0002,113,536