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 listMar 16, 2026 13:29Dominique GarmierDominique GarmierScore: 14,629Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 16, 2026 13:2914,299428,975,8441,023,881,000142,565,0002,678,784
2Mar 16, 2026 13:2914,365430,941,6121,037,710,000131,963,0002,846,720
3Mar 16, 2026 13:2914,462433,859,9011,024,663,000148,660,0002,777,088
4Mar 16, 2026 13:2914,511435,331,2771,057,073,000114,790,0002,781,184
5Mar 16, 2026 13:2914,629438,866,7341,031,994,000140,590,0002,809,856
6Mar 16, 2026 13:2914,739442,175,3431,075,029,000126,415,0002,691,072
7Mar 16, 2026 13:2914,800444,012,2301,067,863,000128,622,0002,846,720
8Mar 16, 2026 13:2914,937448,096,6611,079,024,000133,755,0002,551,808
9Mar 16, 2026 13:2915,030450,900,8991,081,412,000130,170,0002,809,856