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 02:58highload-churnerhighload-churnerScore: 1,480Success
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 02:591,47144,157,108103,249,0000364,544stderr
2Oct 19, 2026 02:591,47744,326,544103,916,0000364,544stderr
3Oct 19, 2026 02:591,47944,370,272103,846,0000372,736stderr
4Oct 19, 2026 02:591,47944,399,494103,673,0000364,544stderr
5Oct 19, 2026 02:591,48044,421,047103,130,0001,019,000368,640stderr
6Oct 19, 2026 02:591,48144,439,110104,108,0000376,832stderr
7Oct 19, 2026 02:591,48444,525,994104,376,0000376,832stderr
8Oct 19, 2026 02:591,52645,789,121103,783,0003,117,000364,544stderr
9Oct 19, 2026 02:591,99759,931,952115,104,0001,034,000229,376stderr