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:30highload-churnerhighload-churnerScore: 1,463Success
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:311,45643,680,756101,896,0000368,640
2Oct 19, 2026 03:311,45943,793,516102,168,0000360,448
3Oct 19, 2026 03:311,46243,860,983102,419,0000364,544
4Oct 19, 2026 03:311,46343,894,809102,426,0000360,448
5Oct 19, 2026 03:311,46343,901,797102,326,0000360,448
6Oct 19, 2026 03:311,46443,942,209102,664,0000360,448
7Oct 19, 2026 03:311,46644,009,420102,618,0000245,760
8Oct 19, 2026 03:311,47144,159,491102,372,0001,014,000372,736
9Oct 19, 2026 03:311,48544,575,310102,119,0002,055,000364,544