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 6, 2026 13:24Victor MerckléVictor MerckléScore: 4,850Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 6, 2026 13:254,671140,149,069385,945,0004,444,0002,646,016
2Jun 6, 2026 13:254,672140,174,746388,392,0004,436,0002,646,016
3Jun 6, 2026 13:254,724141,731,595384,007,0004,461,0002,641,920
4Jun 6, 2026 13:254,751142,531,773388,527,0004,411,0002,646,016
5Jun 6, 2026 13:254,850145,526,888395,601,0004,503,0002,641,920
6Jun 6, 2026 13:254,853145,606,975397,924,0004,453,0002,641,920
7Jun 6, 2026 13:254,855145,650,359391,307,0004,448,0002,641,920
8Jun 6, 2026 13:254,886146,597,835395,756,0004,293,0002,646,016
9Jun 6, 2026 13:254,899146,995,121396,939,0004,313,0002,646,016