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 listJun 26, 2026 01:47Victor MerckléVictor MerckléScore: 2,942Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 26, 2026 01:482,90987,270,436232,812,0003,032,0002,662,400
2Jun 26, 2026 01:482,91587,465,512233,774,0003,123,0002,658,304
3Jun 26, 2026 01:482,92187,630,619234,924,0003,025,0002,662,400
4Jun 26, 2026 01:482,93388,006,440237,016,0002,149,0002,662,400
5Jun 26, 2026 01:482,94288,266,607237,862,00002,662,400
6Jun 26, 2026 01:482,95188,549,907236,098,0003,108,0002,662,400
7Jun 26, 2026 01:482,95288,568,362235,887,0003,201,0002,662,400
8Jun 26, 2026 01:482,95888,752,134236,021,0003,094,0002,662,400
9Jun 26, 2026 01:482,95988,792,287237,805,00002,662,400