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 listJul 8, 2026 09:03Victor MerckléVictor MerckléScore: 3,021Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 8, 2026 09:092,98389,492,818231,021,0003,430,0002,670,592
2Jul 8, 2026 09:093,00090,013,247231,935,0003,361,0002,674,688
3Jul 8, 2026 09:093,00490,147,923231,738,0003,689,0002,678,784
4Jul 8, 2026 09:093,02090,622,175233,099,0003,140,0002,670,592
5Jul 8, 2026 09:093,02190,639,097234,159,0003,429,0002,674,688
6Jul 8, 2026 09:093,03491,037,637233,885,0003,380,0002,674,688
7Jul 8, 2026 09:093,04291,261,050235,632,0003,470,0002,678,784
8Jul 8, 2026 09:093,04791,435,133234,957,0003,701,0002,420,736
9Jul 8, 2026 09:093,06591,974,470236,852,0003,700,0002,674,688