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 07:10Andrew EpsteinAndrew EpsteinScore: 1,873Success
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 07:111,46844,047,742100,583,0001,202,0002,170,880stderr
2Oct 31, 2026 07:111,48644,581,107102,272,0001,037,0002,154,496stderr
3Oct 31, 2026 07:111,49244,777,655103,071,0001,214,0002,150,400stderr
4Oct 31, 2026 07:111,84855,469,771105,865,0003,037,0002,150,400stderr
5Oct 31, 2026 07:111,87356,218,117108,999,0001,271,0002,150,400stderr
6Oct 31, 2026 07:111,94258,267,291116,529,0001,011,0002,150,400stderr
7Oct 31, 2026 07:111,96859,062,986112,615,0002,994,0002,170,880stderr
8Oct 31, 2026 07:112,02160,658,890125,064,0002,017,0002,154,496stderr
9Oct 31, 2026 07:112,06261,867,257123,867,0003,035,0002,154,496stderr