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 listJun 27, 2026 07:37Shikhar SoniShikhar SoniScore: 32,197Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 27, 2026 07:3831,926957,790,023938,731,0009,217,0002,125,824
2Jun 27, 2026 07:3832,066961,997,596942,768,0009,415,0002,125,824
3Jun 27, 2026 07:3832,073962,203,129943,059,0009,318,0002,125,824
4Jun 27, 2026 07:3832,183965,499,052945,633,0009,895,0002,125,824
5Jun 27, 2026 07:3832,197965,917,149946,191,0009,724,0002,125,824
6Jun 27, 2026 07:3832,335970,069,016950,187,0009,678,0002,125,824
7Jun 27, 2026 07:3833,8811,016,431,438995,458,00010,801,0002,125,824
8Jun 27, 2026 07:3833,8911,016,742,858997,398,0009,019,0002,125,824
9Jun 27, 2026 07:3833,9341,018,025,105998,878,0009,024,0002,125,824