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 2, 2026 12:48Victor MerckléVictor MerckléScore: 5,264Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 2, 2026 12:495,193155,814,600428,270,0009,486,0002,605,056stderr
2Aug 2, 2026 12:495,203156,105,785428,064,0009,484,0002,605,056stderr
3Aug 2, 2026 12:495,211156,334,439426,624,0009,541,0002,605,056stderr
4Aug 2, 2026 12:495,226156,804,641428,573,0009,907,0002,605,056stderr
5Aug 2, 2026 12:495,264157,933,369427,969,0008,791,0002,609,152stderr
6Aug 2, 2026 12:495,287158,623,812432,788,0009,205,0002,600,960stderr
7Aug 2, 2026 12:495,306159,191,980433,278,0007,932,0002,609,152stderr
8Aug 2, 2026 12:495,341160,247,127436,015,0008,754,0002,600,960stderr
9Aug 2, 2026 12:495,369161,079,532432,208,0009,617,0002,600,960stderr