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:52A_ShamanA_ShamanScore: 117,344Success
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:57116,0943,482,822,0843,339,412,000130,966,0002,117,632
2Jun 21, 2026 23:57116,5223,495,665,2033,346,334,000137,363,0002,117,632
3Jun 21, 2026 23:57117,1113,513,339,6443,369,297,000132,101,0002,117,632
4Jun 21, 2026 23:57117,2733,518,214,8963,370,302,000135,352,0002,117,632
5Jun 21, 2026 23:57117,3443,520,347,5653,377,189,000131,061,0002,117,632
6Jun 21, 2026 23:57117,9463,538,393,7523,389,323,000136,522,0002,113,536
7Jun 21, 2026 23:57118,0433,541,300,1283,391,926,000136,967,0002,117,632
8Jun 21, 2026 23:57118,7053,561,175,8063,413,334,000135,654,0002,117,632
9Jun 21, 2026 23:57119,2573,577,715,4503,433,276,000132,006,0002,117,632