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 26, 2026 17:41Shikhar SoniShikhar SoniScore: 33,390Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 26, 2026 17:4233,324999,735,449980,128,0009,696,0002,125,824
2Jun 26, 2026 17:4233,3361,000,084,369980,346,0009,652,0002,125,824
3Jun 26, 2026 17:4233,3471,000,438,305980,847,0009,597,0002,125,824
4Jun 26, 2026 17:4233,3631,000,914,940981,151,0009,847,0002,125,824
5Jun 26, 2026 17:4233,3901,001,712,127981,766,00010,009,0002,125,824
6Jun 26, 2026 17:4233,4041,002,120,218982,476,0009,390,0002,125,824
7Jun 26, 2026 17:4233,5281,005,851,980985,925,00010,018,0002,125,824
8Jun 26, 2026 17:4233,9341,018,031,684997,359,00010,542,0002,125,824
9Jun 26, 2026 17:4234,5401,036,227,4531,016,238,0009,989,0002,125,824