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 listSep 1, 2026 11:39Victor MerckléVictor MerckléScore: 1,766Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 1, 2026 11:401,74752,421,747125,343,0002,018,0002,170,880stderr
2Sep 1, 2026 11:401,75252,560,382126,065,0001,009,0002,170,880stderr
3Sep 1, 2026 11:401,75352,603,715126,099,0001,213,0002,170,880stderr
4Sep 1, 2026 11:401,75552,672,859126,043,0001,033,0002,170,880stderr
5Sep 1, 2026 11:401,76652,987,225125,331,0002,014,0002,170,880stderr
6Sep 1, 2026 11:401,76853,040,252126,843,0001,033,0002,170,880stderr
7Sep 1, 2026 11:401,77653,298,006126,317,0002,028,0002,170,880stderr
8Sep 1, 2026 11:401,77953,385,895126,332,0001,027,0002,170,880stderr
9Sep 1, 2026 11:401,79053,712,831127,235,0002,032,0002,170,880stderr