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 listNov 8, 2026 05:04highload-churnerhighload-churnerScore: 1,469Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 8, 2026 05:051,45943,794,653102,484,0000360,448
2Nov 8, 2026 05:051,46043,828,167101,561,0001,011,000364,544
3Nov 8, 2026 05:051,46744,031,827101,652,0001,008,000364,544
4Nov 8, 2026 05:051,46744,013,006102,099,0001,020,000372,736
5Nov 8, 2026 05:051,46944,092,054102,314,0001,012,000364,544
6Nov 8, 2026 05:051,47044,121,996103,284,0000360,448
7Nov 8, 2026 05:051,48944,673,858102,831,0002,039,000372,736
8Nov 8, 2026 05:051,49544,876,959103,077,0002,037,000364,544
9Nov 8, 2026 05:051,51845,548,040102,378,0001,007,000221,184