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 listJul 10, 2026 19:04Genos0Genos0Score: 60,542Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 10, 2026 19:0557,7561,732,696,5101,669,705,00053,215,0002,113,536
2Jul 10, 2026 19:0557,8091,734,275,0301,671,807,00052,915,0002,113,536
3Jul 10, 2026 19:0557,8461,735,397,7821,672,794,00052,982,0002,113,536
4Jul 10, 2026 19:0560,3181,809,559,8791,750,167,00049,662,0002,113,536
5Jul 10, 2026 19:0560,5421,816,269,4011,756,346,00049,612,0002,113,536
6Jul 10, 2026 19:0560,6731,820,193,3621,760,312,00049,968,0002,113,536
7Jul 10, 2026 19:0560,7251,821,751,1521,760,407,00050,086,0002,113,536
8Jul 10, 2026 19:0560,7651,822,969,9591,763,741,00049,703,0002,113,536
9Jul 10, 2026 19:0560,8001,824,012,6531,764,009,00050,163,0002,113,536