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 22, 2026 06:19olliecrowolliecrowScore: 16,590Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 22, 2026 06:2216,448493,443,0371,402,674,00025,975,0002,748,416
2Apr 22, 2026 06:2216,498494,951,2161,402,199,00029,004,0002,699,264
3Apr 22, 2026 06:2216,518495,552,4461,396,166,00032,980,0002,514,944
4Apr 22, 2026 06:2216,554496,635,7741,401,860,00027,997,0002,674,688
5Apr 22, 2026 06:2216,590497,727,6691,404,040,00030,022,0002,777,088
6Apr 22, 2026 06:2216,637499,115,9791,404,421,00028,988,0002,715,648
7Apr 22, 2026 06:2216,694500,836,0491,422,887,00035,997,0002,637,824
8Apr 22, 2026 06:2217,287518,636,7651,468,640,00029,972,0002,719,744
9Apr 22, 2026 06:2217,356520,700,0801,467,952,00031,977,0002,899,968