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 listOct 31, 2026 04:52Andrew EpsteinAndrew EpsteinScore: 1,596Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 31, 2026 04:561,58047,404,288103,115,0002,028,0002,174,976stderr
2Oct 31, 2026 04:561,58547,565,337103,434,0002,018,0002,179,072stderr
3Oct 31, 2026 04:561,58547,574,480103,867,0002,037,0002,179,072stderr
4Oct 31, 2026 04:561,59347,805,793104,441,0002,043,0002,179,072stderr
5Oct 31, 2026 04:561,59647,889,876105,015,0002,013,0002,179,072stderr
6Oct 31, 2026 04:561,60248,077,265105,518,0002,004,0002,174,976stderr
7Oct 31, 2026 04:561,60448,130,289105,709,0002,006,0002,174,976stderr
8Oct 31, 2026 04:561,62948,884,560106,567,0002,031,0002,174,976stderr
9Oct 31, 2026 04:561,63248,962,349108,138,0002,086,0002,174,976stderr