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 15, 2026 14:47Maya RebholzMaya RebholzScore: 12,626Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 15, 2026 14:4812,608378,261,963361,166,0007,693,0002,134,016
2Jun 15, 2026 14:4812,615378,469,208361,341,0007,732,0002,134,016
3Jun 15, 2026 14:4812,621378,644,724361,183,0007,731,0002,134,016
4Jun 15, 2026 14:4812,621378,643,851361,211,0008,102,0002,134,016
5Jun 15, 2026 14:4812,626378,798,463361,580,0007,755,0002,134,016
6Jun 15, 2026 14:4812,638379,150,374361,996,0007,725,0002,134,016
7Jun 15, 2026 14:4812,676380,292,720362,604,0007,907,0002,134,016
8Jun 15, 2026 14:4812,696380,900,301363,786,0007,704,0002,134,016
9Jun 15, 2026 14:4812,706381,188,501364,054,0007,737,0002,134,016