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 09:48Andrew EpsteinAndrew EpsteinScore: 1,468Success
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 09:571,43943,199,62798,826,0001,106,0002,170,880stderr
2Oct 31, 2026 09:571,45543,653,329100,175,0001,142,0002,162,688stderr
3Oct 31, 2026 09:571,45843,757,674100,034,0001,231,0002,170,880stderr
4Oct 31, 2026 09:571,45843,763,176100,269,0001,120,0002,162,688stderr
5Oct 31, 2026 09:571,46844,065,108101,193,0001,015,0002,170,880stderr
6Oct 31, 2026 09:571,47144,149,971101,565,0001,147,0002,170,880stderr
7Oct 31, 2026 09:571,66549,957,88899,919,0001,026,0002,170,880stderr
8Oct 31, 2026 09:571,97759,337,883114,681,0003,006,0002,174,976stderr
9Oct 31, 2026 09:572,08662,591,850114,787,0003,072,0002,162,688stderr