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 17, 2026 13:06Tomislav TunkovicTomislav TunkovicScore: 1,867Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 17, 2026 13:091,72451,744,644126,057,0001,089,00069,632
2Aug 17, 2026 13:091,76652,994,173126,458,0003,130,00069,632
3Aug 17, 2026 13:091,77353,216,961125,915,0003,029,00069,632
4Aug 17, 2026 13:091,78153,441,208125,539,0002,153,00069,632
5Aug 17, 2026 13:091,86756,034,854126,645,0003,107,00069,632
6Aug 17, 2026 13:091,91557,450,436125,097,0003,011,00077,824
7Aug 17, 2026 13:092,05361,613,987128,134,0003,002,00069,632
8Aug 17, 2026 13:092,11863,566,562133,953,0003,056,00069,632
9Aug 17, 2026 13:092,15164,552,027142,510,0003,193,00069,632