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 listAug 31, 2026 14:12Victor MerckléVictor MerckléScore: 5,005Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 31, 2026 14:134,977149,315,061397,496,0002,296,0002,174,976stderr
2Aug 31, 2026 14:134,985149,579,386396,317,0002,086,0002,174,976stderr
3Aug 31, 2026 14:134,992149,785,797396,846,0003,023,0002,174,976stderr
4Aug 31, 2026 14:134,998149,959,424398,078,0003,077,0002,174,976stderr
5Aug 31, 2026 14:135,005150,174,750397,381,0003,068,0002,174,976stderr
6Aug 31, 2026 14:135,012150,369,242395,595,0003,094,0002,174,976stderr
7Aug 31, 2026 14:135,022150,663,333398,513,0002,102,0002,174,976stderr
8Aug 31, 2026 14:135,030150,910,188398,228,0002,105,0002,174,976stderr
9Aug 31, 2026 14:135,056151,687,476400,653,0002,291,0002,174,976stderr