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 10, 2026 00:47highload-churnerhighload-churnerScore: 12,177Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 10, 2026 02:1211,831354,951,225296,248,00047,938,00020,480
2Oct 10, 2026 02:1212,107363,215,856302,259,00050,433,00020,480
3Oct 10, 2026 02:1212,122363,660,656303,991,00049,241,00020,480
4Oct 10, 2026 02:1212,154364,630,141302,807,00050,159,00020,480
5Oct 10, 2026 02:1212,177365,329,494305,489,00049,283,00020,480
6Oct 10, 2026 02:1212,208366,250,221306,617,00049,074,00020,480
7Oct 10, 2026 02:1212,216366,487,501305,959,00050,105,00020,480
8Oct 10, 2026 02:1212,231366,945,473306,646,00049,745,00024,576
9Oct 10, 2026 02:1212,271368,152,672308,173,00049,290,00020,480