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 listOct 19, 2026 03:39highload-churnerhighload-churnerScore: 1,477Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 19, 2026 03:401,47344,211,612102,134,0001,114,000364,544
2Oct 19, 2026 03:401,47344,190,748103,264,0000360,448
3Oct 19, 2026 03:401,47644,297,809101,634,0002,018,000364,544
4Oct 19, 2026 03:401,47644,281,255102,564,0001,008,000364,544
5Oct 19, 2026 03:401,47744,330,775103,758,0000368,640
6Oct 19, 2026 03:401,47744,339,243103,570,0000360,448
7Oct 19, 2026 03:401,47944,380,457103,932,0000360,448
8Oct 19, 2026 03:401,49744,926,203101,640,0003,127,000360,448
9Oct 19, 2026 03:401,51845,565,571104,153,0002,050,000364,544