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 06:20highload-churnerhighload-churnerScore: 1,430Success
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:211,41042,315,86597,880,0000339,968
2Nov 8, 2026 06:211,42142,658,90999,096,0000339,968
3Nov 8, 2026 06:211,42242,683,22999,070,0000339,968
4Nov 8, 2026 06:211,42942,899,24299,583,0000327,680
5Nov 8, 2026 06:211,43042,907,78898,763,0001,030,000339,968
6Nov 8, 2026 06:211,43543,071,05596,953,0003,244,000339,968
7Nov 8, 2026 06:211,45043,511,38599,304,0002,033,000339,968
8Nov 8, 2026 06:211,45143,540,19598,408,0003,032,00073,728
9Nov 8, 2026 06:211,47244,178,86699,113,0003,259,000339,968