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:50Shikhar SoniShikhar SoniScore: 31,471Success
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:5131,261937,850,298918,535,0009,422,0002,125,824
2Jun 27, 2026 07:5131,336940,089,228920,702,0009,164,0002,125,824
3Jun 27, 2026 07:5131,343940,311,124920,602,0009,863,0002,125,824
4Jun 27, 2026 07:5131,360940,804,036921,409,0009,226,0002,125,824
5Jun 27, 2026 07:5131,471944,151,826923,943,00010,352,0002,125,824
6Jun 27, 2026 07:5131,480944,418,456924,616,0009,590,0002,125,824
7Jun 27, 2026 07:5131,489944,692,728925,601,0009,256,0002,125,824
8Jun 27, 2026 07:5131,538946,146,215926,507,0009,808,0002,125,824
9Jun 27, 2026 07:5131,573947,195,497927,387,0009,538,0002,125,824