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 02:37Andrew EpsteinAndrew EpsteinScore: 1,627Success
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 02:461,60248,065,034105,607,0001,059,0002,174,976
2Oct 31, 2026 02:461,60348,099,196105,557,0001,068,0002,174,976
3Oct 31, 2026 02:461,61648,499,192107,109,0001,059,0002,174,976
4Oct 31, 2026 02:461,62048,617,683107,187,0001,075,0002,174,976
5Oct 31, 2026 02:461,62748,835,416107,240,0002,052,0002,174,976
6Oct 31, 2026 02:461,62848,848,354107,337,0002,090,0002,174,976
7Oct 31, 2026 02:461,62848,842,710106,863,0002,116,0002,220,032
8Oct 31, 2026 02:461,63148,941,772108,113,0002,120,0002,220,032
9Oct 31, 2026 02:461,63148,954,758108,255,0001,054,0002,174,976