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 15:32Victor MerckléVictor MerckléScore: 2,062Success
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 15:341,98359,511,457146,610,0001,010,0002,170,880stderr
2Aug 23, 2026 15:342,04461,334,751150,038,0002,040,0002,170,880stderr
3Aug 23, 2026 15:342,04461,320,472149,749,0002,052,0002,170,880stderr
4Aug 23, 2026 15:342,06161,846,530149,941,0002,010,0002,170,880stderr
5Aug 23, 2026 15:342,06261,874,301152,010,0001,009,0002,170,880stderr
6Aug 23, 2026 15:342,06561,963,791153,421,0002,029,0002,170,880stderr
7Aug 23, 2026 15:342,06561,969,416153,518,0002,079,0002,170,880stderr
8Aug 23, 2026 15:342,07562,264,409152,566,0002,049,0002,170,880stderr
9Aug 23, 2026 15:342,11963,599,144157,147,0001,020,0002,170,880stderr