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 listNov 6, 2026 15:43Andrew EpsteinAndrew EpsteinScore: 1,482Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 6, 2026 15:461,44943,486,07599,181,0001,047,0002,174,976stderr
2Nov 6, 2026 15:461,47144,157,95698,979,0003,022,0002,174,976stderr
3Nov 6, 2026 15:461,47144,136,60199,322,0003,015,0002,174,976stderr
4Nov 6, 2026 15:461,47844,342,71999,993,0003,016,0002,174,976stderr
5Nov 6, 2026 15:461,48244,475,368100,097,0003,160,0002,174,976stderr
6Nov 6, 2026 15:461,48444,522,203100,449,0003,008,0002,174,976stderr
7Nov 6, 2026 15:461,49244,783,758100,501,0003,219,0002,174,976stderr
8Nov 6, 2026 15:461,52245,662,26399,723,0001,052,0002,174,976stderr
9Nov 6, 2026 15:461,53646,085,121100,323,0003,043,0002,174,976stderr