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 listJun 22, 2026 00:06A_ShamanA_ShamanScore: 104,201Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 22, 2026 00:09103,7443,112,343,6622,973,774,000128,825,0002,117,632
2Jun 22, 2026 00:09103,8633,115,918,4522,978,099,000127,828,0002,113,536
3Jun 22, 2026 00:09104,1663,125,001,4372,988,906,000126,697,0002,117,632
4Jun 22, 2026 00:09104,1973,125,932,0102,985,249,000130,923,0002,113,536
5Jun 22, 2026 00:09104,2013,126,030,1892,989,321,000127,178,0002,113,536
6Jun 22, 2026 00:09104,3083,129,244,9152,992,383,000127,064,0002,113,536
7Jun 22, 2026 00:09104,6133,138,414,5413,001,352,000127,001,0002,113,536
8Jun 22, 2026 00:09104,6473,139,426,5823,000,047,000129,939,0002,113,536
9Jun 22, 2026 00:09104,8913,146,742,9053,009,895,000127,267,0002,113,536