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 5, 2026 15:44Victor MerckléVictor MerckléScore: 5,216Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 5, 2026 15:465,189155,674,530430,130,0008,946,0002,605,056
2Jun 5, 2026 15:465,203156,100,861429,403,0006,978,0002,596,864
3Jun 5, 2026 15:465,209156,281,185428,316,0007,901,0002,596,864
4Jun 5, 2026 15:465,214156,430,026428,819,0007,950,0002,596,864
5Jun 5, 2026 15:465,216156,503,279430,762,0008,087,0002,596,864
6Jun 5, 2026 15:465,225156,751,270432,055,0006,806,0002,596,864
7Jun 5, 2026 15:465,235157,070,878432,730,0009,045,0002,600,960
8Jun 5, 2026 15:465,240157,215,336428,594,0009,141,0002,596,864
9Jun 5, 2026 15:465,300159,023,405430,652,0009,173,0002,596,864