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 listApr 27, 2026 12:19Victor MerckléVictor MerckléScore: 37,410Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 27, 2026 12:2037,0191,110,584,3263,054,582,00052,940,0002,641,920
2Apr 27, 2026 12:2037,1971,115,921,3663,088,784,00057,939,0002,703,360
3Apr 27, 2026 12:2037,3341,120,032,8903,089,243,00055,950,0002,863,104
4Apr 27, 2026 12:2037,3741,121,241,1363,088,633,00057,955,0002,564,096
5Apr 27, 2026 12:2037,4101,122,309,5263,096,185,00055,949,0002,691,072
6Apr 27, 2026 12:2037,5021,125,073,8773,099,063,00048,969,0002,625,536
7Apr 27, 2026 12:2037,6781,130,353,6603,080,731,00061,934,0002,473,984
8Apr 27, 2026 12:2038,4181,152,546,6433,088,665,00047,963,0002,617,344
9Apr 27, 2026 12:2038,8041,164,145,2013,083,890,00055,943,0002,527,232