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 listMar 3, 2026 23:19olliecrowolliecrowScore: 12,508Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 3, 2026 23:1912,170365,102,048919,271,00020,960,0002,863,104
2Mar 3, 2026 23:1912,316369,467,097917,436,00021,962,0002,588,672
3Mar 3, 2026 23:1912,416372,486,469919,583,00019,969,0002,764,800
4Mar 3, 2026 23:1912,446373,383,073918,290,00019,984,0002,756,608
5Mar 3, 2026 23:1912,508375,254,704937,526,00019,947,0002,678,784
6Mar 3, 2026 23:1912,644379,327,589939,957,00020,932,0002,744,320
7Mar 3, 2026 23:1912,732381,954,259936,337,00020,940,0002,928,640
8Mar 3, 2026 23:1912,838385,137,303919,850,00019,975,0002,945,024
9Mar 3, 2026 23:1917,845535,338,815910,434,00021,962,0002,523,136