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:59highload-churnerhighload-churnerScore: 1,457Success
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 06:001,44343,315,804100,812,000073,728
2Nov 8, 2026 06:001,45043,502,728100,430,0001,012,00073,728
3Nov 8, 2026 06:001,45243,575,558101,704,000073,728
4Nov 8, 2026 06:001,45643,693,064102,254,000081,920
5Nov 8, 2026 06:001,45743,714,673101,968,0000339,968
6Nov 8, 2026 06:001,46243,889,720102,504,000081,920
7Nov 8, 2026 06:001,46944,098,914103,219,000081,920
8Nov 8, 2026 06:001,49044,704,338102,027,0002,047,000339,968
9Nov 8, 2026 06:001,50545,153,984103,418,0002,018,00081,920