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 21, 2026 23:39A_ShamanA_ShamanScore: 116,099Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 21, 2026 23:40114,8183,444,567,7863,310,688,000124,329,0002,117,632
2Jun 21, 2026 23:40115,1103,453,328,8183,320,670,000123,088,0002,113,536
3Jun 21, 2026 23:40115,3743,461,226,5993,330,112,000121,662,0002,113,536
4Jun 21, 2026 23:40115,4613,463,832,9293,327,551,000126,881,0002,117,632
5Jun 21, 2026 23:40116,0993,482,998,3193,345,215,000128,209,0002,117,632
6Jun 21, 2026 23:40116,7123,501,377,7813,361,527,000129,120,0002,113,536
7Jun 21, 2026 23:40117,0493,511,487,8553,379,700,000122,270,0002,117,632
8Jun 21, 2026 23:40117,4933,524,811,6243,389,593,000125,562,0002,113,536
9Jun 21, 2026 23:40117,6033,528,107,1463,386,967,000131,615,0002,113,536