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:28Shikhar SoniShikhar SoniScore: 32,708Success
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:2932,539976,188,374955,495,00010,834,0002,125,824
2Jun 27, 2026 07:2932,634979,037,297959,406,0009,277,0002,125,824
3Jun 27, 2026 07:2932,638979,169,255959,199,0009,585,0002,125,824
4Jun 27, 2026 07:2932,689980,670,088960,710,0009,594,0002,125,824
5Jun 27, 2026 07:2932,708981,241,113961,787,0009,403,0002,125,824
6Jun 27, 2026 07:2932,721981,652,940961,373,0009,917,0002,125,824
7Jun 27, 2026 07:2932,780983,402,606963,143,0009,921,0002,125,824
8Jun 27, 2026 07:2932,873986,214,884966,687,0009,691,0002,125,824
9Jun 27, 2026 07:2933,009990,282,564969,977,00010,362,0002,125,824