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 23, 2026 17:51Victor MerckléVictor MerckléScore: 2,435Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 23, 2026 17:532,37571,253,705183,783,0001,196,0002,170,880stderr
2Aug 23, 2026 17:532,38371,493,030182,691,0001,008,0002,170,880stderr
3Aug 23, 2026 17:532,38771,619,416183,968,0001,033,0002,170,880stderr
4Aug 23, 2026 17:532,38871,640,025184,249,0001,274,0002,170,880stderr
5Aug 23, 2026 17:532,43573,064,990185,379,0001,012,0002,170,880stderr
6Aug 23, 2026 17:532,44673,391,722187,896,0001,007,0002,170,880stderr
7Aug 23, 2026 17:532,46573,961,041187,587,0001,005,0002,170,880stderr
8Aug 23, 2026 17:532,49674,893,569192,153,0001,029,0002,170,880stderr
9Aug 23, 2026 17:532,53275,972,898197,352,0001,262,0002,170,880stderr